Timed sequence structure for a graphical program

ABSTRACT

A system and method for executing a plurality of graphical code portions as a timed sequence is described. The graphical code portions may be included in a graphical program and configured with information specifying a sequential order of execution and execution timing information. During execution of the graphical program, the graphical code portions are executed sequentially in the sequential order and in accordance with the execution timing information. In one embodiment a timed sequence structure node may be utilized to specify the timed sequence. For example, the user may include the timed sequence structure node in the graphical program and associate the plurality of graphical code portions with the timed sequence structure node such that the timed sequence structure node species a sequential order of execution for the graphical code portions. The user may also configure the timed sequence structure node with execution timing information for one or more of the graphical code portions.

PRIORITY CLAIM

This application claims benefit of priority of U.S. provisionalapplication Ser. No. 60/601,692 titled “Timed Sequence Structure andTimed Loop with Sequence Frames,” filed Aug. 13, 2004, whose inventorswere Jacob Komerup, Biren Shah, Aljosa Vrancic, Matthew C. Curtis, andSteven W. Rogers.

This application also claims benefit of priority of U.S. provisionalapplication Ser. No. 60/601,598 titled “Combination Structure Nodes in aGraphical Program,” filed Aug. 13, 2004, whose inventors were JacobKomerup, Biren Shah, and Aljosa Vrancic.

This application also claims benefit of priority of U.S. provisionalapplication Ser. No. 60/601,948 titled “Graphical Programming Systemwith Deterministic Communication,” filed Aug. 16, 2004, whose inventorswere Aljosa Vrancic and Jacob Komerup.

This application is also a continuation-in-part of U.S. patentapplication Ser. No. 10/893,745 titled “Graphically Representing Timingin a Graphical Program,” filed Jul. 16, 2004, whose inventors were JacobKomerup, Jeffrey L. Kodosky, Hugo A. Andrade Biren Shah, Aljosa Vrancic,and Michael L. Santori.

FIELD OF THE INVENTION

The present invention relates to the field of graphical programming, andmore particularly to a system and method for enabling a graphicalprogram to execute a timed sequence of graphical code portions.

DESCRIPTION OF THE RELATED ART

Traditionally, high level text-based programming languages have beenused by programmers in writing application programs. Many different highlevel text-based programming languages exist, including BASIC, C, Java,FORTRAN, Pascal, COBOL, ADA, APL, etc. Programs written in these highlevel text-based languages are translated to the machine language levelby translators known as compilers or interpreters. The high leveltext-based programming languages in this level, as well as the assemblylanguage level, are referred to herein as text-based programmingenvironments.

Increasingly, computers are required to be used and programmed by thosewho are not highly trained in computer programming techniques. Whentraditional text-based programming environments are used, the user'sprogramming skills and ability to interact with the computer systemoften become a limiting factor in the achievement of optimal utilizationof the computer system.

There are numerous subtle complexities which a user must master beforehe can efficiently program a computer system in a text-basedenvironment. The task of programming a computer system to model orimplement a process often is further complicated by the fact that asequence of mathematical formulas, steps or other procedures customarilyused to conceptually model a process often does not closely correspondto the traditional text-based programming techniques used to program acomputer system to model such a process. In other words, the requirementthat a user program in a text-based programming environment places alevel of abstraction between the user's conceptualization of thesolution and the implementation of a method that accomplishes thissolution in a computer program. Thus, a user often must substantiallymaster different skills in order to both conceptualize a problem orprocess and then to program a computer to implement a solution to theproblem or process. Since a user often is not fully proficient intechniques for programming a computer system in a text-based environmentto implement his solution, the efficiency with which the computer systemcan be utilized often is reduced.

To overcome the above shortcomings, various graphical programmingenvironments now exist which allow a user to construct a graphicalprogram or graphical diagram, also referred to as a block diagram. U.S.Pat. Nos. 4,901,221; 4,914,568; 5,291,587; 5,301,301; and 5,301,336;among others, to Kodosky et al disclose a graphical programmingenvironment which enables a user to easily and intuitively create agraphical program. Graphical programming environments such as thatdisclosed in Kodosky et al can be considered a higher and more intuitiveway in which to interact with a computer. A graphically basedprogramming environment can be represented at a level above text-basedhigh level programming languages such as C, Basic, Java, etc.

A user may assemble a graphical program by selecting various icons ornodes which represent desired functionality, and then connecting thenodes together to create the program. The nodes or icons may beconnected by lines representing data flow between the nodes, controlflow, or execution flow. Thus the block diagram may include a pluralityof interconnected icons such that the diagram created graphicallydisplays a procedure or method for accomplishing a certain result, suchas manipulating one or more input variables and/or producing one or moreoutput variables. In response to the user constructing a diagram orgraphical program using the block diagram editor, data structures and/orprogram instructions may be automatically constructed which characterizean execution procedure that corresponds to the displayed procedure. Thegraphical program may be compiled or interpreted by a computer.

A graphical program may have a graphical user interface. For example, increating a graphical program, a user may create a front panel or userinterface panel. The front panel may include various graphical userinterface elements or front panel objects, such as user interfacecontrols and/or indicators, that represent or display the respectiveinput and output that will be used by the graphical program, and mayinclude other icons which represent devices being controlled.

Thus, graphical programming has become a powerful tool available toprogrammers. Graphical programming environments such as the NationalInstruments LabVIEW product have become very popular. Tools such asLabVIEW have greatly increased the productivity of programmers, andincreasing numbers of programmers are using graphical programmingenvironments to develop their software applications. In particular,graphical programming tools are being used for test and measurement,data acquisition, process control, man machine interface (MMI),supervisory control and data acquisition (SCADA) applications, modeling,simulation, image processing/machine vision applications, and motioncontrol, among others.

Many text-based programming languages such as C, BASIC, Java, etc., havean inherent control flow because statements execute in the order inwhich they appear in the program. In contrast, for many types ofgraphical programs, data flow is the main principle governing programexecution. In other words, in a graphical program that is based on adata flow model, a node may execute when all data inputs have arrived atthe node's input terminals. The node may then supply data to its outputterminals when the node has finished executing, and this data may thenpass to input terminals of other nodes in the diagram that are connectedto the node's output terminals. Thus, for this type of graphicalprogram, execution of different portions of the program is data-driven.Thus, in a pure data-flow model, execution order for different portionsof the graphical program is not necessarily guaranteed.

Therefore, for many data-flow based graphical programs, it is necessaryto introduce a layer of control flow over the basic data-flow model. Itis often necessary to explicitly specify an execution order fordifferent portions of a graphical program to force the portions toexecute in a desired sequential order.

SUMMARY OF THE INVENTION

According to one embodiment of the invention, a plurality of graphicalcode portions may be included in a graphical program. Each graphicalcode portion may include one or more graphical program nodes and mayrepresent a function or sub-task to be performed in an ordered sequencewith other functions or sub-tasks. A sequential order of execution maybe configured for the graphical code portions. For example, the user mayprovide input to the graphical programming development environment tospecify the sequential order of execution for the graphical codeportions.

First execution timing information may also be configured for one ormore of the graphical code portions. For example, the user may provideinput to the graphical programming development environment to specifythe first execution timing information. In various embodiments, thefirst execution timing information may comprise any kind of informationthat affects the timing of execution of one or more of the graphicalcode portions during execution of the graphical program. As one example,the first execution timing information may specify a time when agraphical code portion should begin executing. Exemplary types ofexecution timing information are described below.

The graphical program may then be executed. Executing the graphicalprogram may comprise executing the plurality of graphical code portions.The graphical code portions may be executed sequentially in thesequential order and in accordance with the first execution timinginformation. For example, if the first execution timing informationspecifies that a particular graphical code portion should beginexecuting at a time T, then execution of the sequence of graphical codeportions may be controlled so that the graphical code portion beginsexecution at the time T.

In one embodiment the user may configure the timed sequence of graphicalcode portions with a timing source, on which the execution timing isbased. In various embodiments, any of various kinds of timing sourcesmay be used.

As noted above, the user may configure any of various kinds of executiontiming information for the graphical code portions. For example, in oneembodiment the user may configure a deadline for a particular graphicalcode portion, where the deadline specifies a time by which execution ofthe graphical code portion must complete. In one embodiment thespecified time by which execution of the graphical code portion mustcomplete may be relative to a time when the graphical code portionbegins execution.

As another example, in one embodiment the user may configure an offsetfor a particular graphical code portion, where the offset for thegraphical code portion specifies a length of time to wait before thegraphical code portion begins executing. (In one embodiment the offsetmay only apply to the first graphical code portion of the sequence.)

As another example, in one embodiment the user may configure a starttime for a particular graphical code portion, where the start timespecifies a time when the graphical code portion should begin executing.In one embodiment the start time may be an absolute time value (withrespect to the timing source). In another embodiment the start time maybe relative to another time value.

As another example, in one embodiment the user may configure a priorityfor a particular graphical code portion. During execution of thegraphical program, the graphical code portion may be executed accordingto the configured priority. The user may configure different prioritiesfor different graphical code portions.

As another example, in one embodiment the user may configure a timeoutfor a particular graphical code portion. The timeout for the graphicalcode portion may specify a maximum length of time the graphical codeportion can wait before beginning to execute.

In one embodiment, the user may configure execution timing informationfor a particular graphical code portion, where the execution timinginformation is based on one or more execution time values for thegraphical code portion that executed previously. For example, theprevious graphical code portion may execute to produce one or moreexecution time values, and these execution time values may be used tocontrol execution timing for the next graphical code portion. As oneexample, the next graphical code portion may be timed to begin executingat say, 50 ms, after the previous graphical code portion completesexecution. Thus, in this example, the previous graphical code portionexecutes to produce an “execution completion time” execution time value,which is then used to control the execution start time for the nextgraphical code portion.

One technique for specifying the sequential order and the firstexecution timing information for the different graphical programportions is through the use of a timed sequence structure node, alsoreferred to as simply a timed sequence structure. The user may include atimed sequence structure node in the graphical program and may associatethe plurality of graphical code portions with the timed sequencestructure node such that the timed sequence structure node species asequential order of execution for the graphical code portions. The usermay also configure the timed sequence structure node with executiontiming information for one or more of the graphical code portions.During execution of the graphical program, the timed sequence structurenode may be operable to control execution of the graphical code portionsto cause the graphical code portions to execute in the desiredsequential order and in accordance with the execution timinginformation.

In one embodiment the timed sequence structure node may include aplurality of ordered frames. The user may be able to specify the desirednumber of frames, N, for the timed sequence structure and may associatea graphical code portion with each frame. For example, in one embodimenteach frame may include an interior portion, and the user may associate agraphical code portion with a frame by positioning or displaying thegraphical code portion within the interior portion. The plurality ofordered frames may define an execution order for the correspondingportions of graphical source code, such that during execution of thegraphical program, the portions of graphical source code are executedsequentially according to this execution order. For example, duringexecution of the graphical program, the portion of graphical source codein frame 0 may execute first, followed by the portion of graphicalsource code in frame 1, followed by the portion of graphical source codein frame 2, etc., up to the portion of graphical source code in frame N.

In various embodiments, a timed sequence structure may have any ofvarious appearances in the graphical program. In one embodiment, only asingle frame may be visible at a time. The user may be able to scrollthrough the frames to view the desired one. In another embodiment, all(or at least a subset) of the frames of the sequence structure may bevisible simultaneously. The frames may be positioned or laid out withinthe graphical program in any of various ways. In one embodiment, theframes may be displayed side by side in a left-to-right order, e.g.,such that the right-side border of one frame is also the left-sideborder of an adjacent frame. In other embodiments, frames may bepositioned in an up-to-down order, or in a combination of left-to-rightand up-to-down orders.

Any of various technqiues may be used in determining the execution orderof the frames. In one embodiment, the execution order for a particularframe may be inherently specified by the frame's location among theother frames. For example, if the frames are displayed in aleft-to-right order, then execution of the frames (i.e., execution ofthe graphical source code portions within the frames) may also proceedin this same left-to-right order. In another embodiment, the user mayprovide user input to specify a desired execution order for the frames.

The timed sequence structure may also allow the user to specify a timingsource and specify various other execution timing information for theframes of the timed sequence structure. For example, the user mayconfigure one or more of the frames with deadlines, timeouts, starttimes, priorities, etc., similarly as described above.

BRIEF DESCRIPTION OF THE DRAWINGS

A better understanding of the present invention can be obtained when thefollowing detailed description of the preferred embodiment is consideredin conjunction with the following drawings, in which:

FIG. 1 illustrates an exemplary computer system operable to createand/or execute a graphical program that includes one or more timedloops;

FIG. 1A illustrates an embodiment in which the computer system of FIG. 1is coupled to another computer system via a network;

FIG. 2A illustrates an instrumentation control system according to oneembodiment;

FIG. 2B illustrates an industrial automation system according to oneembodiment;

FIG. 3A is a high level block diagram of an exemplary system which mayexecute or utilize a graphical program that includes a timed loop;

FIG. 3B illustrates an exemplary system which may perform control and/orsimulation functions utilizing a graphical program that includes a timedloop;

FIG. 4 is an exemplary block diagram of the computer system illustratedin FIGS. 1, 1A, 2A, 2B, and 3B;

FIG. 5 is a flowchart diagram illustrating one embodiment of a methodfor creating a graphical program operable to execute a timed loop;

FIG. 6 illustrates an exemplary icon which intuitively represents atimed loop;

FIG. 7 illustrates a simple example in which three nodes have beenincluded within the border of a timed loop;

FIG. 8 illustrates an exemplary configuration dialog for setting timinginformation for a timed loop;

FIG. 9 illustrates a context menu with an option for automaticallyreplacing a While loop with a timed loop;

FIG. 10 is a flowchart diagram illustrating one embodiment of a methodfor specifying timing relationships among nodes in a graphical program;

FIGS. 11 and 12 illustrate exemplary timing wires between two nodes;

FIG. 13 illustrates an alternative technique for displaying a timingrelationship between two nodes;

FIG. 14 illustrates the portion of graphical source code illustrated inFIG. 11, where the graphical source code is executed in a timed loop;

FIG. 15 is a flowchart diagram illustrating one embodiment of a methodfor viewing timing of one or more loops in a graphical program;

FIG. 16 illustrates an exemplary GUI for viewing timing of loops in agraphical program;

FIG. 17 illustrates a GUI similar to that of FIG. 16, where another rowhas been added to indicate timing of network communication performed bythe graphical program, relative to timing of loops in the graphicalprogram;

FIG. 17A illustrates a GUI similar to that of FIG. 17, where timing ofloops executed in two different graphical programs is displayed togetherwith timing information indicating network communication in which thetwo graphical programs communicate with each other;

FIG. 18 illustrates an alternative embodiment of a GUI for viewingtiming of loops in a graphical program;

FIG. 19 is a flowchart diagram illustrating one embodiment of a methodfor executing a graphical program which has a plurality of timed loops,wherein the timed loops utilize timing sources that are related to orderived from each other;

FIG. 20 illustrates an exemplary hierarchy of clocks arranged as a tree;

FIG. 21 illustrates four exemplary late modes for defining the behaviorof a late timed loop;

FIG. 22 illustrates a chart showing an example of operation of a timedloop when it is configured in each of six exemplary late modes;

FIG. 23 illustrates an expanded chart showing operation of the timedloop for additional late modes;

FIG. 24 illustrates a node that creates a timing source reference thatcan be used as the timing source for one or more timed loops;

FIG. 25 illustrates a node that stops and deletes a specified timingsource;

FIG. 26 illustrates a node that creates a hierarchy of timing sourcesbased on specified timing source names;

FIG. 27 illustrates a node that synchronizes the start of a plurality oftimed loops;

FIG. 28 illustrates a node that causes a specified timed loop to beaborted;

FIGS. 29-38 illustrate several exemplary graphical programs that utilizeone embodiment of a timed loop structure;

FIG. 39A is a flowchart diagram illustrating one embodiment of a methodfor creating a graphical program that executes a timed sequence ofgraphical code portions;

FIG. 39 illustrates one embodiment of a timed sequence structure;

FIG. 40 illustrates an exemplary dialog for specifying timinginformation for the next frame in a timed sequence structure;

FIG. 41 illustrates an exemplary configuration dialog for a timedsequence structure;

FIG. 42 illustrates an exemplary timed sequence structure with threeframes;

FIGS. 43-46 illustrate some simple examples of a timed sequencestructure;

FIG. 47A is a flowchart diagram illustrating one embodiment of a methodfor creating a graphical program that executes a timed sequence ofgraphical code portions within a timed loop;

FIG. 47 illustrates an integrated structure that combines functionalityof a timed loop and a timed sequence structure, where the structureincludes two frames;

FIG. 48 illustrates an exemplary dialog for configuring the timed loopof the integrated structure of FIG. 47; and

FIG. 49 illustrates an exemplary dialog for configuring the right datanode within each frame of the timed loop of the integrated structure ofFIG. 47.

While the invention is susceptible to various modifications andalternative forms, specific embodiments thereof are shown by way ofexample in the drawings and are herein described in detail. It should beunderstood, however, that the drawings and detailed description theretoare not intended to limit the invention to the particular formdisclosed, but on the contrary, the intention is to cover allmodifications, equivalents and alternatives falling within the spiritand scope of the present invention as defined by the appended claims.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Incorporation by Reference

The following references are hereby incorporated by reference in theirentirety as though fully and completely set forth herein:

U.S. Pat. No. 4,914,568 titled “Graphical System for Modeling a Processand Associated Method,” issued on Apr. 3, 1990.

U.S. Pat. No. 5,481,741 titled “Method and Apparatus for ProvidingAttribute Nodes in a Graphical Data Flow Environment”.

U.S. Pat. No. 6,173,438 titled “Embedded Graphical Programming System”filed Aug. 18, 1997.

U.S. Pat. No. 6,219,628 titled “System and Method for Configuring anInstrument to Perform Measurement Functions Utilizing Conversion ofGraphical Programs into Hardware Implementations,” filed Aug. 18, 1997.

U.S. Patent Application Publication No. 20010020291 (Ser. No.09/745,023) titled “System and Method for Programmatically Generating aGraphical Program in Response to Program Information,” filed Dec. 20,2000.

U.S. patent application Ser. No. 09/976,726 titled, “System and Methodfor Enabling a Graphical Program to Respond to User Interface Events,”filed Oct. 12, 2001.

U.S. patent application Ser. No. 09/832,997 titled, “System and Methodfor Creating a Graphical Program Including a Plurality of Portions to beExecuted Sequentially,” filed Apr. 10, 2001.

U.S. patent application Ser. No. 10/893,745 titled “GraphicallyRepresenting Timing in a Graphical Program,” filed Jul. 16, 2004.

U.S. provisional application Ser. No. 60/601,692 titled “Timed SequenceStructure and Timed Loop with Sequence Frames,” filed Aug. 13, 2004.

U.S. provisional application Ser. No. 60/601,598 titled “CombinationStructure Nodes in a Graphical Program,” filed Aug. 13, 2004.

U.S. provisional application Ser. No. 60/601,948 titled “GraphicalProgramming System with Deterministic Communication,” filed Aug. 16,2004.

Terms

The following is a glossary of terms used in the present application:

Memory Medium—Any of various types of memory devices or storage devices.The term “memory medium” is intended to include an installation medium,e.g., a CD-ROM, floppy disks 104, or tape device; a computer systemmemory or random access memory such as DRAM, DDR RAM, SRAM, EDO RAM,Rambus RAM, etc.; or a non-volatile memory such as a magnetic media,e.g., a hard drive, or optical storage. The memory medium may compriseother types of memory as well, or combinations thereof. In addition, thememory medium may be located in a first computer in which the programsare executed, or may be located in a second different computer whichconnects to the first computer over a network, such as the Internet. Inthe latter instance, the second computer may provide programinstructions to the first computer for execution. The term “memorymedium” may include two or more memory mediums which may reside indifferent locations, e.g., in different computers that are connectedover a network.

Carrier Medium—a memory medium as described above, as well as signalssuch as electrical, electromagnetic, or digital signals, conveyed via acommunication medium such as a bus, network and/or a wireless link.

Programmable Hardware Element—includes various types of programmablehardware, reconfigurable hardware, programmable logic, orfield-programmable devices (FPDs), such as one or more FPGAs (FieldProgrammable Gate Arrays), or one or more PLDs (Programmable LogicDevices), such as one or more Simple PLDs (SPLDs) or one or more ComplexPLDs (CPLDs), or other types of programmable hardware. A programmablehardware element may also be referred to as “reconfigurable logic”.

Medium—includes one or more of a memory medium, carrier medium, and/orprogrammable hardware element; encompasses various types of mediums thatcan either store program instructions/data structures or can beconfigured with a hardware configuration program.

Program—the term “program” is intended to have the full breadth of itsordinary meaning. The term “program” includes 1) a software programwhich may be stored in a memory and is executable by a processor or 2) ahardware configuration program useable for configuring a programmablehardware element.

Software Program—the term “software program” is intended to have thefull breadth of its ordinary meaning, and includes any type of programinstructions, code, script and/or data, or combinations thereof, thatmay be stored in a memory medium and executed by a processor. Exemplarysoftware programs include programs written in text-based programminglanguages, such as C, C++, Pascal, Fortran, Cobol, Java, assemblylanguage, etc.; graphical programs (programs written in graphicalprogramming languages); assembly language programs; programs that havebeen compiled to machine language; scripts; and other types ofexecutable software. A software program may comprise two or moresoftware programs that interoperate in some manner.

Hardware Configuration Program—a program, e.g., a netlist or bit file,that can be used to program or configure a programmable hardwareelement.

Graphical Program—A program comprising a plurality of interconnectednodes or icons, wherein the plurality of interconnected nodes or iconsvisually indicate functionality of the program.

The following provides examples of various aspects of graphicalprograms. The following examples and discussion are not intended tolimit the above definition of graphical program, but rather provideexamples of what the term “graphical program” encompasses:

The nodes in a graphical program may be connected in one or more of adata flow, control flow, and/or execution flow format. The nodes mayalso be connected in a “signal flow” format, which is a subset of dataflow.

Exemplary graphical program development environments which may be usedto create graphical programs include LabVIEW, DasyLab, DiaDem andMatrixx/SystemBuild from National Instruments, Simulink from theMathWorks, VEE from Agilent, WiT from Coreco, Vision Program Managerfrom PPT Vision, SoftWIRE from Measurement Computing, Sanscript fromNorthwoods Software, Khoros from Khoral Research, SnapMaster from HEMData, VisSim from Visual Solutions, ObjectBench by SES (Scientific andEngineering Software), and VisiDAQ from Advantech, among others.

The term “graphical program” includes models or block diagrams createdin graphical modeling environments, wherein the model or block diagramcomprises interconnected nodes or icons that visually indicate operationof the model or block diagram; exemplary graphical modeling environmentsinclude Simulink, SystemBuild, VisSim, Hypersignal Block Diagram, etc.

A graphical program may be represented in the memory of the computersystem as data structures and/or program instructions. The graphicalprogram, e.g., these data structures and/or program instructions, may becompiled or interpreted to produce machine language that accomplishesthe desired method or process as shown in the graphical program.

Input data to a graphical program may be received from any of varioussources, such as from a device, unit under test, a process beingmeasured or controlled, another computer program, a database, or from afile. Also, a user may input data to a graphical program or virtualinstrument using a graphical user interface, e.g., a front panel.

A graphical program may optionally have a GUI associated with thegraphical program. In this case, the plurality of interconnected nodesare often referred to as the block diagram portion of the graphicalprogram.

Node—In the context of a graphical program, an element that may beincluded in a graphical program. A node may have an associated icon thatrepresents the node in the graphical program, as well as underlying codeor data that implements functionality of the node. Exemplary nodesinclude function nodes, terminal nodes, structure nodes, etc.

Data Flow Graphical Program (or Data Flow Diagram)—A graphical programor diagram comprising a plurality of interconnected nodes, wherein theconnections between the nodes indicate that data produced by one node isused by another node.

Graphical User Interface—this term is intended to have the full breadthof its ordinary meaning. The term “Graphical User Interface” is oftenabbreviated to “GUI”. A GUI may comprise only one or more input GUIelements, only one or more output GUI elements, or both input and outputGUI elements.

The following provides examples of various aspects of GUIs. Thefollowing examples and discussion are not intended to limit the ordinarymeaning of GUI, but rather provide examples of what the term “graphicaluser interface” encompasses:

A GUI may comprise a single window having one or more GUI Elements, ormay comprise a plurality of individual GUI Elements (or individualwindows each having one or more GUI Elements), wherein the individualGUI Elements or windows may optionally be tiled together.

A GUI may be associated with a graphical program. In this instance,various mechanisms may be used to connect GUI Elements in the GUI withnodes in the graphical program. For example, when Input Controls andOutput Indicators are created in the GUI, corresponding nodes (e.g.,terminals) may be automatically created in the graphical program orblock diagram. Alternatively, the user can place terminal nodes in theblock diagram which may cause the display of corresponding GUI Elementsfront panel objects in the GUI, either at edit time or later at runtime. As another example, the GUI may comprise GUI Elements embedded inthe block diagram portion of the graphical program.

Front Panel—A Graphical User Interface that includes input controls andoutput indicators, and which enables a user to interactively control ormanipulate the input being provided to a program, and view output of theprogram, while the program is executing.

A front panel is a type of GUI. A front panel may be associated with agraphical program as described above.

In an instrumentation application, the front panel can be analogized tothe front panel of an instrument. In an industrial automationapplication the front panel can be analogized to the MMI (Man MachineInterface) of a device. The user may adjust the controls on the frontpanel to affect the input and view the output on the respectiveindicators.

Graphical User Interface Element—an element of a graphical userinterface, such as for providing input or displaying output. Exemplarygraphical user interface elements comprise input controls and outputindicators

Input Control—a graphical user interface element for providing userinput to a program. Exemplary input controls comprise dials, knobs,sliders, input text boxes, etc.

Output Indicator—a graphical user interface element for displayingoutput from a program. Exemplary output indicators include charts,graphs, gauges, output text boxes, numeric displays, etc. An outputindicator is sometimes referred to as an “output control”.

Computer System—any of various types of computing or processing systems,including a personal computer system (PC), mainframe computer system,workstation, network appliance, Internet appliance, personal digitalassistant (PDA), television system, grid computing system, or otherdevice or combinations of devices. In general, the term “computersystem” can be broadly defined to encompass any device (or combinationof devices) having at least one processor that executes instructionsfrom a memory medium.

Measurement Device—includes instruments, data acquisition devices, smartsensors, and any of various types of devices that are operable toacquire and/or store data. A measurement device may also optionally befurther operable to analyze or process the acquired or stored data.Examples of a measurement device include an instrument, such as atraditional stand-alone “box” instrument, a computer-based instrument(instrument on a card) or external instrument, a data acquisition card,a device external to a computer that operates similarly to a dataacquisition card, a smart sensor, one or more DAQ or measurement cardsor modules in a chassis, an image acquisition device, such as an imageacquisition (or machine vision) card (also called a video capture board)or smart camera, a motion control device, a robot having machine vision,and other similar types of devices. Exemplary “stand-alone” instrumentsinclude oscilloscopes, multimeters, signal analyzers, arbitrary waveformgenerators, spectroscopes, and similar measurement, test, or automationinstruments.

A measurement device may be further operable to perform controlfunctions, e.g., in response to analysis of the acquired or stored data.For example, the measurement device may send a control signal to anexternal system, such as a motion control system or to a sensor, inresponse to particular data. A measurement device may also be operableto perform automation functions, i.e., may receive and analyze data, andissue automation control signals in response.

FIG. 1—Computer System

FIG. 1 illustrates a computer system 82 operable to execute a graphicalprogram. In various embodiments, timing of loops, nodes, or otherelements within the graphical program may be configured in various ways,as described in detail below. For example, in one embodiment thegraphical program may include one or more timed loops or timedsequences, as described below.

As shown in FIG. 1, the computer system 82 may include a display deviceoperable to display the graphical program as the graphical program iscreated and/or executed. The display device may also be operable todisplay a graphical user interface or front panel of the graphicalprogram during execution of the graphical program. The graphical userinterface may comprise any type of graphical user interface, e.g.,depending on the computing platform.

As shown in FIG. 1A, in one embodiment the computer system 82 may becoupled to another computer system 90 via a network. The computersystems 82 and 90 may operate together to perform various operationsdescribed herein.

The computer system 82 may include a memory medium(s) on which one ormore computer programs or software components according to oneembodiment of the present invention may be stored. For example, thememory medium may store one or more graphical programs configured asdescribed below. Also, the memory medium may store a graphicalprogramming development environment application used to create suchgraphical programs and/or an execution subsystem used to execute thegraphical programs. The memory medium may also store operating systemsoftware, as well as other software for operation of the computersystem.

Exemplary Systems

Embodiments of the present invention may be involved with performingtest and/or measurement functions; controlling and/or modelinginstrumentation or industrial automation hardware; modeling andsimulation functions, e.g., modeling or simulating a device or productbeing developed or tested, etc. Exemplary test applications where thegraphical program may be used include hardware-in-the-loop testing andrapid control prototyping, among others.

However, it is noted that the present invention can be used for aplethora of applications and is not limited to the above applications.In other words, applications discussed in the present description areexemplary only, and the present invention may be used in any of varioustypes of systems. Thus, graphical programs as described herein may beused in any of various types of applications, including the control ofother types of devices such as multimedia devices, video devices, audiodevices, telephony devices, Internet devices, etc., as well as generalpurpose software applications such as word processing, spreadsheets,network control, network monitoring, financial applications, games, etc.

FIG. 2A illustrates an exemplary instrumentation control system 100which may implement embodiments of the invention. The system 100comprises a host computer 82 which connects to one or more instruments.The host computer 82 may comprise a CPU, a display screen, memory, andone or more input devices such as a mouse or keyboard as shown.

The computer 82 may operate with the one or more instruments to analyze,measure or control a unit under test (UUT) or process 150. In oneembodiment the computer 82 may execute a graphical program involved withthe instrumentation control system 100, where timing of elements withinthe graphical program has been configured according to one or more ofthe methods described below.

The one or more instruments may include a GPIB instrument 112 andassociated GPIB interface card 122, a data acquisition board 114 andassociated signal conditioning circuitry 124, a VXI instrument 116, aPXI instrument 118, a video device or camera 132 and associated imageacquisition (or machine vision) card 134, a motion control device 136and associated motion control interface card 138, and/or one or morecomputer based instrument cards 142, among other types of devices. Thecomputer system may couple to and operate with one or more of theseinstruments. The instruments may be coupled to a unit under test (UUT)or process 150, or may be coupled to receive field signals, typicallygenerated by transducers. The system 100 may be used in a dataacquisition and control application, in a test and measurementapplication, an image processing or machine vision application, aprocess control application, a man-machine interface application, asimulation application, or a hardware-in-the-loop validationapplication, among other types of applications.

FIG. 2B illustrates an exemplary industrial automation system 160 whichmay implement embodiments of the invention. The industrial automationsystem 160 is similar to the instrumentation or test and measurementsystem 100 shown in FIG. 2A. Elements which are similar or identical toelements in FIG. 2A have the same reference numerals for convenience.The system 160 may comprise a computer 82 which connects to one or moredevices or instruments. The computer 82 may comprise a CPU, a displayscreen, memory, and one or more input devices such as a mouse orkeyboard as shown.

The computer 82 may operate with the one or more devices to a process ordevice 150 to perform an automation function, such as MMI (Man MachineInterface), SCADA (Supervisory Control and Data Acquisition), portableor distributed data acquisition, process control, advanced analysis, orother control. In one embodiment the computer 82 may execute a graphicalprogram involved in performing the automation function, where timing ofelements within the graphical program has been configured according toone or more of the methods described below.

The one or more devices may include a data acquisition board 114 andassociated signal conditioning circuitry 124, a PXI instrument 118, avideo device 132 and associated image acquisition card 134, a motioncontrol device 136 and associated motion control interface card 138, afieldbus device 170 and associated fieldbus interface card 172, a PLC(Programmable Logic Controller) 176, a serial instrument 182 andassociated serial interface card 184, or a distributed data acquisitionsystem, such as the Fieldpoint system available from NationalInstruments, among other types of devices.

FIG. 3A is a high level block diagram of an exemplary system which mayexecute or utilize a graphical program that includes a timed loop ortimed sequence. FIG. 3A illustrates a general high-level block diagramof a generic control and/or simulation system which comprises acontroller 92 and a plant 94. The controller 92 represents a controlsystem/algorithm the user may be trying to develop. The plant 94represents the system the user may be trying to control. For example, ifthe user is designing an ECU for a car, the controller 92 is the ECU andthe plant 94 is the car's engine (and possibly other components such astransmission, brakes, and so on.) The user may create a graphicalprogram that specifies or implements the functionality of one or both ofthe controller 92 and the plant 94. For example, a control engineer mayuse a modeling and simulation tool to create a model (graphical program)of the plant 94 and/or to create the algorithm (graphical program) forthe controller 92. In one embodiment, timing of the graphical programmay be configured according to one or more of the methods describedbelow.

FIG. 3B illustrates an exemplary system which may perform control and/orsimulation functions utilizing a graphical program that includes a timedloop or timed sequence. As shown, the controller 92 may be implementedby a computer system 82 or other device 144 (e.g., including a processorand memory medium and/or including a programmable hardware element) thatexecutes or implements a graphical program. In a similar manner, theplant 94 may be implemented by a computer system 82 or other device 144(e.g., including a processor and memory medium and/or including aprogrammable hardware element) that executes or implements a graphicalprogram, or may be implemented by a real physical system, e.g., a carengine.

In one embodiment, one or more graphical programs may be created whichare used in performing rapid control prototyping. Rapid ControlPrototyping (RCP) generally refers to the process by which a userdevelops a control algorithm and quickly executes that algorithm on atarget controller connected to a real system. The user may develop thecontrol algorithm using a graphical program, and the graphical programmay execute on the controller 92, e.g., on a computer system 82 or otherdevice 144. The computer system 82 may be a platform that supports realtime execution, e.g., a device including a processor that executes areal-time operating system (RTOS), or a device including a programmablehardware element.

In one embodiment, one or more graphical programs may be created whichare used in performing Hardware in the Loop (HIL) simulation. Hardwarein the Loop (HIL) refers to the execution of the plant model 94 in realtime to test operation of a real controller 92. For example, once thecontroller 92 has been designed, it may be expensive and complicated toactually test the controller 92 thoroughly in a real plant, e.g., a realcar. Thus, the plant model (implemented by a graphical program) isexecuted in real time to make the real controller 92 believe that it isconnected to a real plant, e.g., a real engine.

In the embodiments of FIGS. 2A, 2B, and 3B above, one or more of thevarious devices may couple to each other over a network, such as theInternet, an Intranet, or a LAN. In one embodiment, the user operates toselect a target device from a plurality of possible target devices forprogramming or configuration using a graphical program. Thus the usermay create a graphical program on a computer and use (execute) thegraphical program on that computer or may deploy the graphical programto a target device (for remote execution on the target device) that isremotely located from the computer and coupled to the computer through anetwork.

Graphical software programs which perform data acquisition, analysisand/or presentation, e.g., for measurement, instrumentation control,industrial automation, modeling, or simulation, such as in theapplications shown in FIGS. 2A, 2B, and 3B, may be referred to asvirtual instruments.

FIG. 4—Computer System Block Diagram

FIG. 4 is a block diagram representing one embodiment of the computersystem 82 illustrated in FIGS. 1, 1A, 2A, 2B, or 3B. It is noted thatany type of computer system configuration or architecture can be used asdesired, and FIG. 4 illustrates a representative PC embodiment. It isalso noted that the computer system may be a general purpose computersystem, a computer implemented on a card installed in a chassis, orother types of embodiments. Elements of a computer not necessary tounderstand the present description have been omitted for simplicity.

The computer may include at least one central processing unit or CPU(processor) 160 which is coupled to a processor or host bus 162. The CPU160 may be any of various types, including an ×86 processor, e.g., aPentium class, a PowerPC processor, a CPU from the SPARC family of RISCprocessors, as well as others. A memory medium, typically comprising RAMand referred to as main memory, 166 is coupled to the host bus 162 bymeans of memory controller 164. The main memory 166 may store agraphical program configured with timing according to one or more of themethods described herein. The main memory may also store operatingsystem software, as well as other software for operation of the computersystem.

The host bus 162 may be coupled to an expansion or input/output bus 170by means of a bus controller 168 or bus bridge logic. The expansion bus170 may be the PCI (Peripheral Component Interconnect) expansion bus,although other bus types can be used. The expansion bus 170 includesslots for various devices such as described above. In the illustratedembodiment, the computer 82 further comprises a video display subsystem180 and hard drive 182 coupled to the expansion bus 170.

As shown, a device 190 may also be connected to the computer. In oneembodiment the device 190 may include a processor and memory whichexecute a real time operating system. In another embodiment the device190 may also or may instead include a programmable hardware element. Inone embodiment the computer system 82 may be operable to deploy agraphical program to the device 190 for execution of the graphicalprogram on the device 190. The deployed graphical program may take theform of graphical program instructions or data structures that directlyrepresents the graphical program. Alternatively, the deployed graphicalprogram may take the form of text code (e.g., C code) generated from thegraphical program. As another example, the deployed graphical programmay take the form of compiled code that was generated from either thegraphical program or from text code that in turn was generated from thegraphical program.

FIG. 5—Timed Loop

Many computerized applications require operations to be performed withprecise timing. In particular, many operations need to be performed as aloop (i.e., need to be performed repetitively for multiple iterations),where each iteration of the loop is precisely timed. Other operationsneed to be performed as a loop where each iteration of the loop istriggered by an event being generated. An entity referred to herein as atimed loop may enable these behaviors to be implemented for a graphicalprogram. FIG. 5 is a flowchart diagram illustrating one embodiment of amethod for creating a graphical program operable to execute a timedloop. As described below, the user may be able to specify variousaspects of the timing of the timed loop. It is noted that FIG. 5illustrates a representative embodiment, and alternative embodiments arecontemplated. Also, various elements may be combined, omitted, orperformed in different orders. The method shown in FIG. 5 may be used inconjunction with any of the systems or devices shown in the aboveFigures, among other systems and devices.

The graphical program may be created in response to user input, e.g.,the user may create the graphical program by placing or “dragging anddropping” icons or nodes on the display and interconnecting the nodes ina desired fashion. In response to the user assembling the graphicalprogram, data structures may be created and stored which represent thegraphical program. The nodes or icons may be interconnected in one ormore of a data flow, control flow, or execution flow format. Thegraphical program may thus comprise a plurality of interconnected nodesor icons that visually indicate the functionality of the program. Asnoted above, the graphical program may comprise a block diagram and mayalso include a user interface portion or front panel portion. Where thegraphical program includes a user interface portion, the user mayoptionally assemble the user interface on the display. As one example,the user may use the LabVIEW graphical programming developmentenvironment to create the graphical program.

According to one embodiment, the timed loop may be represented as aparticular node or icon in the graphical program. Thus, as shown in 301of FIG. 5, a timed loop may be displayed in the graphical program inresponse to user input. For example, during the process of assemblingthe graphical program as described above, the user may cause the timedloop to be included in the graphical program by selecting a particulartimed loop node or icon from a palette, issuing a menu command todisplay the timed loop, etc. In various embodiments the user may performany of various actions to cause the timed loop to be displayed orincluded in the graphical program. Also, the timed loop may have anykind of visual appearance within the graphical program. FIG. 6illustrates one exemplary icon that intuitively represents a timed loop.

As described above, the loop may represent a portion of the graphicalprogram which is executed repetitively during execution of the graphicalprogram. Thus, in 303 the graphical source code (i.e., one or morenodes) to be executed repetitively may be associated with the timed loopin response to user input. In various embodiments the graphical sourcecode may be associated with the timed loop in various ways. For theexemplary timed loop of FIG. 6, the graphical source code may beassociated with the timed loop by placing it inside the loop border 400.Thus, the user may position one or more nodes or icons within the loopborder 400, such as function nodes, sub-program nodes, etc. Duringexecution of the graphical program, the nodes or icons within the loopborder 400 may be executed at each iteration of the timed loop. Thenodes or icons within the loop border 400 may also be interconnectedsimilarly as other nodes in the graphical program to indicate data flow,control flow, and/or execution flow.

FIG. 7 illustrates a simple example in which three nodes have beenincluded within the border of a timed loop node. The three nodes areinterconnected to indicate data flow among the nodes. For each iterationof the timed loop, the “Read” node executes to read data from a hardwaredevice. The “PID” node then executes to process the data. The “Write”node then executes to write the processed data to a hardware device.

In other embodiments, the graphical source code to be executed at eachiteration of the timed loop may be associated with the timed loop inother ways. For example, in one alternative embodiment, the timed loopmay have a separate block diagram which can be viewed separately fromthe main block diagram in which the timed loop node or icon isdisplayed. The user may arrange and interconnect nodes on the timedloop's block diagram similarly as for the main block diagram. Duringexecution of the graphical program, nodes on the timed loop's blockdiagram may be executed at each iteration of the timed loop. In anotherembodiment, the timed loop may be configured with a reference to aportion of code to be executed at each iteration of the timed loop, andthis portion of code may be created or stored separately from thegraphical program in which the timed loop node or icon is included.

In 305 the timed loop may be configured with timing information inresponse to user input. In one embodiment the timing information mayinclude an execution period which specifies a desired period at whichthe timed loop should execute during execution of the graphical program.In one embodiment the execution period controls the time at whichexecution begins for each iteration of the timed loop. For example, ifthe execution period is 100 ms, then iteration N of the timed loop maybegin at time T, iteration N+1 may begin at time T+100 ms, iteration N+2may begin at time T+200 ms, etc.

In one embodiment the execution period for the timed loop may be basedon a particular timing source. The user may specify a timing source toassociate with the timed loop, where the timing source comprises anentity useable as a source of timing and scheduling for the timed loop.The timing of the timed loop may be based on a periodic signal or pulseprovided by the timing source. In one embodiment, the units for theexecution period of the timed loop may be based on the timing source.For example, the user may simply specify a period of “100”, withoutspecifying a time unit. This may signify that a new iteration of thetimed loop should begin at every 100th tick or pulse of the timingsource. For a 1 kHz timing source, this may correspond to a period of100 ms. For a 1 MHz timing source, this may correspond to a period of100 μs. In another embodiment, the user may specify both a number ofticks and the desired units, e.g., may directly specify a period of 100ms.

In various embodiments, the timed loop may be configured with any kindof timing source. One example of a timing source that may be used tocontrol timing of the timed loop is a 1 kHz system clock provided by aPC computer system, such as the computer system 82 discussed above.Another example is the 1 MHz timer of RIO hardware boards from NationalInstruments Corp. In another embodiment the timing source may be basedon internal countdown registers of the processor of the computer systemthat executes the graphical program. For example, in one embodimentcountdown registers of a Pentium processor may be utilized as a 1 MHztiming source. In other embodiments, any of various other kinds oftiming sources may be utilized. Examples of other timing sources includeanalog input/analog output (AI/AO), counter (CTR), and digital IO (DIO)ports on DAQ or other hardware boards.

In one embodiment, the ticks or pulses of a timing source may not occurat regular intervals in time. Thus, the timing of loop iterations may becontrolled relative to ticks or pulses of the timing source, but theiterations may or may not occur at regular intervals in time. Forexample, in one embodiment the timing of the iterations of the timedloop may be based on an event, where the event may or may not begenerated at regular intervals in time. For example, in one embodiment,configuring the timed loop with timing information may compriseassociating one or more events with the timed loop in response to userinput. When an event associated with the timed loop is generated duringexecution of the graphical program, an iteration of the timed loop mayoccur in response. In other words, the graphical source code associatedwith the timed loop may execute each time one of the associated eventsis generated. Thus, in this embodiment, the generation of an eventassociated with the timed loop may constitute a tick or pulse of thetiming source for the timed loop. For some applications, it may bedesirable to base the timing of a process performed by the graphicalprogram on the generation of an event in this manner, e.g., to configurethe graphical program to perform an action or process each time aparticular event is generated.

In one embodiment the timed loop may be configured to iterate inresponse to each occurrence of the event(s) associated with the timedloop, i.e., a new iteration of the timed loop may begin each time theassociated event is generated. In another embodiment, the timed loop maybe configured to iterate only after the event has been generated acertain number of times. For example, where an event A has beenassociated with or specified as the timing source for the timed loop,the user may specify an execution period of 50 to signify that a newiteration of the timed loop should begin every 50th time the event A isgenerated.

In various embodiments, any kinds of events may be associated with orspecified as the timing source for the timed loop, includingsoftware-generated or software-based events and/or hardware-generated orhardware-based events. In one embodiment, one or more events associatedwith or generated by hardware devices may be associated with the timedloop. Thus, the timed loop may iterate in response to an event beinggenerated by a hardware device during execution of the graphicalprogram. As one example, the graphical program may perform a measurementfunction and may include a timed loop configured to iterate in responseto each instance of an event generated by a data acquisition device.Other examples of events that may be associated with the timed loopinclude interrupts, system events, timer events, etc.

In another embodiment one or more events associated with networkoperation may be associated with the timed loop. For example, the timedloop may be configured to wake up or iterate in response to packetarrival event being generated, where the packet arrival event indicatesthat a network packet has been received. As other examples, the timedloop may be configured to iterate in response to a buffer full event,where the buffer full event indicates that a network buffer is full, orthe timed loop may be configured to iterate in response to other kindsof buffer-based events, such as a buffer empty event or a bufferhalf-full event.

In another embodiment, one or more user interface events may beassociated with the timed loop. The graphical program may have agraphical user interface that includes a plurality of user interfaceelements. Various user interface events may be associated with the userinterface elements on the graphical user interface. For example, userinterface events may be generated in response to user actions performedon the graphical user interface, such as clicking a button, invoking amenu, typing into a string control, etc. Thus, the timed loop may beconfigured to iterate in response to any of various kinds of userinterface events.

In one embodiment, the events associated with the timed loop may beevents that are internal to the graphical program or internal to agraphical programming development environment with which the graphicalprogram is associated. For example, the events may include userinterface event associated with a native user interface control on thegraphical program's user interface. In another embodiment, one or moreevents that are external to the graphical program or external to thegraphical programming development environment may be associated with thetimed loop. For example, events such as ActiveX events or .NET eventsmay be associated with the timed loop. As another example, DAQ events orevents generated by hardware devices may be associated with the timedloop, as noted above.

Thus, in various embodiments the user may associate any kind of timingsource with the timed loop for acting as a trigger for iterations of thetimed loop, where the timing source may or may not cause iterations ofthe loop to occur at regular time intervals. In one embodiment, the usermay also specify a timing source name to identify a particular instanceof the timing source associated with the timed loop (described below).

In one embodiment the graphical programming development environment mayenable users or vendors to construct their own timing sources. Forexample, an interface to which a timing source must comply may bedefined, and users or vendors may create a timing source component ormodule that implements this interface. Ticks or pulses of the timingsource (or events generated by the timing source) may be based on anyarbitrary hardware or software function. The timed loop structure may beabstracted from the timing source, e.g., may simply receive notificationof ticks or events generated by the timing source but may not have anyknowledge about what causes these ticks or events. This abstraction mayfacilitate the use of a plug-in framework in which users or vendors mayplug-in or utilize custom timing sources that they create.

As an example, a third-party vendor of a particular measurement devicemay want users of the graphical programming development environment tobe able to utilize the measurement device, and in particular may wantusers to be able to control the timing of a loop based on an eventgenerated by or based on a hardware function of the measurement device.Thus, the vendor may create custom code that implements the interfacedefined for timing sources, where the custom code is operable togenerate ticks or events based on the operation of the measurementdevice. The vendor may provide the custom timing source to users, e.g.,as a software component or module, so that the users can use the timingsource to control timed loops in their graphical programs.

Referring again to 305 of FIG. 5, in one embodiment the timed loop mayalso be configured with an offset. The offset may specify the amount oftime (or the number of ticks or events generated by the timing source)by which to delay the execution of the first iteration of the timedloop. Units for the offset may be based on the timing source, similarlyas described above. For example, if the user specifies an offset of 30and a period of 100, and if the timing source for the timed loop is a 1KHz clock, then the first iteration of the timed loop may beginexecuting at time T=30 ms, and subsequent iterations may begin executingat times of 130 ms, 230 ms, 330 ms, etc. As described below, a timingsource may effectively start when all the timed loops that utilize thetiming source are ready to execute. I.e., time T=0 may occur as soon asall the timed loops that utilize the timing source are ready to execute.The offset specified for a timed loop may refer to an offset from thetime when the timing source effectively starts, i.e., an offset fromtime T=0.

If the graphical program includes multiple timed loops, the loop offsetvalues can be used to synchronize the timed loops or align their phases.For example, the user can configure two timed loops to use the sameinstance of a timing source by specifying the same name for the timingsource in the configuration dialog for each timed loop, e.g., byspecifying the same name in the “Source name” field of the configurationdialog of FIG. 8. For example, the user can specify an offset of 0 forone timed loop and an offset of 100 for another timed loop. If the twotimed loops have the same period then each Nth pair of iterations of thetimed loops may be separated by 100 ticks of the timing source. Forexample, if the period is 150 then the first timed loop may iterate attimes T=0, T=150, T=300, etc., and the second timed loop may iterate attimes T=100, T=250, T=400, etc.

In one embodiment, the timed loop may also be configured with apriority. In one embodiment the graphical program may include multipletimed loops, and the priority values of the timed loops may be used inprioritizing execution of the timed loops. The priority of each timedloop specifies when the timed loop executes relative to other timedloops. Priority settings may be utilized to create applications withmultiple tasks that can preempt each other in the same graphicalprogram. In various embodiments, any desired priority system may beutilized. In one embodiment the higher the value the user specifies forthe priority of a timed loop, the higher the priority the timed loop hasrelative to other timed loops in the graphical program. In oneembodiment, priorities may range from 1 to 2,147,480,000.

In one embodiment one or more nodes, e.g., sub-program nodes, in thegraphical program may be configured to execute at a time-criticalpriority. In one embodiment timed loops may execute at a priority belowthe time-critical priority but above high priority, which means thattimed loops may execute in the data flow of the block diagram ahead ofany node not configured to run at a time-critical priority.

In one embodiment the timed loop may also be configured with a timeoutvalue. As described above, in one embodiment the timed loop may beconfigured to wake up and perform a loop iteration in response to anevent being generated. However, it is possible that the event that issupposed to trigger an iteration of the loop to execute may never begenerated or may not be generated within an expected time frame. Thus,the loop may effectively be stuck waiting for an event that neverhappens or happens late. The user may specify a timeout value, e.g., avalue in milliseconds, to handle this situation. In one embodiment, ifthe loop is not normally awakened before the timeout value elapses(e.g., as measured from the time the last iteration of the loop finishedexecuting) then the loop may be awakened due to expiration of thetimeout. As described below, in one embodiment the timed loop may bepassed a “wakeup reason” each time an iteration of the loop beginsexecuting, i.e., a data item indicating the reason the iteration of thetimed loop began executing. In this situation the timed loop may bepassed a wakeup reason indicating that the reason the loop iterationbegan is that the timeout expired. The user may include graphical sourcecode in the timed loop to evaluate the wakeup reason and takeappropriate action in the case of a timeout.

In various embodiments the timed loop may be configured with the timinginformation in 305 in any of various ways. In one embodiment, the timedloop may include one or more terminals to which the user can connect awire(s) specifying the timing information. For example, the timed loopof FIG. 6 includes an input node 401, also referred to as aconfiguration node 401, to the left of the loop border. The input node401 includes various terminals to which the user may connect wires todynamically set the respective properties during execution of thegraphical program. For example, the terminal labeled with the “dt”symbol represents the execution period of the timed loop. Thus, the usercan connect a wire to this terminal to specify the desired executionperiod for the timed loop. The input node 401 may also include terminalsfor connecting wires to dynamically specify the loop's timing source,priority, offset, mode, and other timing information.

In other embodiments, the user may configure the timing information ofthe timed loop in other ways. As one example, the user may interact witha dialog box, property page, or wizard to statically configure variousproperties affecting the timing of the timed loop. For example, the usermay invoke a configuration dialog such as illustrated in FIG. 8, e.g.,by invoking a “Configure” option on a context menu for the timed loop orconfiguration node 401 or by double-clicking on the loop border 400 orconfiguration node 401. The user may then interact with theconfiguration dialog to specify information such as a timing source,period, offset, priority, or other timing information. In one embodimentthe user may utilize the configuration dialog to specify otherproperties of the timed loop as well, such as a loop name, whether ornot to log timing data for the timed loop, a timeout value for the timedloop, a late mode defining behavior of the timed loop on lateiterations, etc.

In one embodiment the user may have the option to set properties of thetimed loop both statically by using the configuration dialog anddynamically by connecting wires to terminals on the block diagram of thegraphical program. For example, checking the “Use terminal” checkboxeson the FIG. 8 configuration dialog may cause the respective terminals toappear in the input node 401 in FIG. 6. The user may then connect wiresto the terminals in the input node 401 to cause the respectiveproperties to be set dynamically during execution of the graphicalprogram. In the FIG. 8 example, the “Use terminal” checkboxes for theperiod and priority are checked. Thus, the user can connect wires torespective terminals for these properties to cause the properties to beset dynamically during execution of the graphical program, whereas otherproperties regarding timing information for the timed loop arestatically configured through the configuration dialog.

If the user configures one or more properties for the timed loop (e.g.,the period, priority, offset, etc.) using the configuration dialog thenthe specified values may appear in the configuration node 401 to theleft of the timed loop. This allows the user to see how the timed loopis configured by simply looking at the block diagram of the graphicalprogram, i.e., by looking at the configuration node 401 of the timedloop. In prior graphical programming systems, the user typically cannotsee how a loop or other structure node is configured by viewinginformation directly on the block diagram, but rather is required toinvoke a dialog or other window to view the configuration information.

Thus in one embodiment the configuration node 401 may display terminalsfor specific properties that the user requested (e.g., by checking a“Use terminal” checkbox in a configuration dialog as described above),where the user can connect wires to the terminals to cause therespective properties to be dynamically set. The configuration node 401may also display values for statically configured properties of thetimed loop, where the values were specified using a configuration dialogas described above. For example, the configuration node 401 may includea plurality of displayed rows or fields, where each row or fieldrepresents one of the properties of the timed loop. Some of the rows orfields, i.e., the ones corresponding to properties that are setdynamically, may visually indicate that they are terminals to which theuser can connect wires. Other rows or fields, i.e., the onescorresponding to properties that are statically configured through theconfiguration dialog, may simply display the value specified by the userbut may not visually indicate that they are terminals to which the usercan connect wires.

However, in one embodiment the user may still be able to connect a wireto a row or field corresponding to a property that is staticallyconfigured, even though the row or field may not currently include ormay not visually indicate a terminal for connecting a wire. The act ofconnecting a wire to the row or field may cause the row or field tochange so that it includes or visually indicates a terminal. Thus, therespective property may be automatically changed from a staticallyconfigured property to a property that is dynamically set by data fromthe connected wire.

In one embodiment the user may also be able to configure how informationin the configuration node 401 is displayed. For example, the user mayconfigure the properties shown in the configuration node to berepresented either iconically and/or textually. In one embodiment eachrow or field in the configuration node 401 may by default display asmall icon that visually represents the respective property of the timedloop. For example, in the configuration node 401 shown in FIG. 6, aclock icon represents the timing source of the timed loop, a staggered“3, 2, 1” icon represents the priority of the timed loop, etc. The usermay be able to request that text names for the properties be displayedin addition to or instead of the icons, e.g., by selecting a menu itemfrom a context menu for the configuration node 401.

Also, in one embodiment the user may be able to specify which propertiesof the timed loop to show in the configuration node 401. For example,the user may want some of the properties to be displayed and others tobe hidden to avoid clutter on the block diagram. In various embodimentsthe user may be able to specify which properties to show in theconfiguration node 401 in any of various ways. For example, the user maybe able to request that only the properties that are dynamically set,i.e., the ones to which wires are connected, be shown in theconfiguration node 401, or the user may interact with a dialog box tocheck boxes to specify which properties to show or hide.

A configuration dialog such as the one shown in FIG. 8 may also enablethe user to select a timing source for the timed loop. In the example ofFIG. 8, the user has selected to use a 1 kHz PC timer as the timingsource. The timing sources that appear in the “Source type” list box inthe configuration dialog may depend on the configuration of the user'scomputer system. For example, if one or more known hardware devices withknown timing sources are connected to the computer system then thetiming sources of these hardware devices may also appear in the listbox. As one example, if a National Instruments RIO hardware board isinstalled in the computer system then the 1 MHz RIO timer may appear asanother timing source that the user can select. As described above, inone embodiment the graphical programming development environment mayprovide a framework that allows users or third-party vendors to createtheir own custom timing sources. Any custom timing sources that havebeen created may be registered with the graphical programmingdevelopment environment and may appear as timing sources that the usercan select in the configuration dialog.

In another embodiment the user may configure a timing source to bedynamically or programmatically set for the timed loop by addinggraphical source code to the block diagram of the graphical program,where the graphical source code specifies the timing source. Forexample, the user may include one or more nodes in the graphical programto set up a timing source from a hardware device and may connect a wirespecifying the timing source to a timing source terminal on the inputnode 401.

As discussed above, in one embodiment one or more events may beassociated with the timed loop. Any desired technique may be used toassociate the one or more events with the timed loop. In one embodiment,the user may utilize a graphical user interface to associate one or moreevents with the timed loop, e.g., by interacting with a dialog box orwizard. For example, the graphical user interface may display a list ofevents and allow the user to select the events of interest. In anotherembodiment the user may configure the block diagram of the graphicalprogram with information specifying the one or more events, e.g., byconnecting one or more wires representing the one or more events to thetimed loop.

In one embodiment, the one or more events to associate with the timedloop may be dynamically determined during execution of the graphicalprogram. Also, the one or more events may be dynamically associated withthe loop during execution of the graphical program, or the eventsassociated with the timed loop may be dynamically changed. In oneembodiment, a registration node (or nodes) may be included in the blockdiagram of the graphical program. The registration node may be executedto dynamically register an event with the timed loop. Similarly, thegraphical program may include one or more nodes operable to dynamicallyun-register an event or dynamically change the events associated withthe timed loop.

Occasionally, an iteration of a timed loop might execute later than thetime specified by the user. For example, the timed loop may beconfigured with an execution period of 10 ms, but an aberrant conditionor preemption by another timed loop may cause a particular iteration ofthe timed loop to take longer than 10 ms to complete, thus causing thenext iteration of the loop to be late. For different applications it maybe desirable for the timed loop to behave in different ways when lateiterations occur. In one embodiment the user may be able to specifydifferent modes to determine how the timed loop handles late iterations.

In one embodiment, the user may be able to specify the following optionsfor handling late iterations of a timed loop:

-   -   Execution of the timed loop can be aligned with the originally        established schedule    -   A new schedule that starts at the current time can be defined    -   The timed loop can process the missed iterations    -   The timed loop can skip any missed iterations

For example, if the user specifies a period of 100 ms and an offset of30 ms for the timed loop then the first loop iteration is expected tobegin execution 30 ms after the first timing source starts running andin multiples of 100 ms after that, i.e., at 130 ms, 230 ms, 330 ms, etc.However it is possible, for example, that the first loop iterationoccurs late, e.g., due to data flow necessary for the timed loop tobegin taking longer than necessary to reach the timed loop in the blockdiagram of the graphical program. For example, the timed loop may not beready to begin execution until 240 ms have elapsed.

Because other timed loops or hardware devices might already be runningat the schedule originally specified, the user might want to align thelate timed loop with the already running global schedule, which meansthe timed loop should align itself as quickly as possible with theoriginally specified schedule. In this case, the first loop iterationwould begin execution at 330 ms, and subsequent iterations wouldcontinue to run at multiples of 100 ms, i.e., at 430 ms, 530 ms, etc.

However, if aligning the timed loop with other timed loops or otherhardware devices is not important then the user may want the timed loopto begin execution as soon as possible and use the current time as itsactual offset. In this case, the first loop iteration would beginexecution at 240 ms, and subsequent loop iterations would begin at 340ms, 440 ms, etc.

In some applications, if an iteration of the timed loop occurs late thenthe timed loop might miss data generated by other timed loops orhardware devices. In one embodiment a buffer may hold data from themissed iterations. In one embodiment the user may want the timed loop toprocess the missed data before it aligns with the schedule specified.However, a timed loop that processes the missed data may cause jitter,which is the amount of time that a loop cycle time varies from thespecified schedule. Thus, in some applications the user may not want thetimed loop to process the missed data. If the user does not want toprocess the missed data, the timed loop can ignore older data in thebuffer that the loop iterations missed and process only the latest data,such as the data available at the next iteration and subsequentiterations.

In one embodiment the user may specify late mode options for handlinglate timed loop iterations such as described above by using aconfiguration dialog to statically configure the late mode options. Forexample, the “Timed Loop action on late iterations” section of theconfiguration dialog illustrated in FIG. 8 allows the user to specifyvarious options. In one embodiment the timed loop may by default discardany data generated during missed iterations and maintain the originallyspecified schedule. For this mode setting, the icon for the “Mode”property of the configuration node 401 may appear with a “D” for discardand an “M” for maintain, as illustrated in FIG. 6. The user can removethe checkmark from the “Discard missed periods” checkbox in theconfiguration dialog to cause the timed loop to instead process datagenerated by missed or late loop iterations. For this mode setting, theicon for the “Mode” property of the configuration node 401 may appearwith a “P” for process. The user can remove the checkmark from the“Maintain original phase” checkbox in the configuration dialog toconfigure the timed loop to execute on a new schedule based on theexecution time of the first iteration of the timed loop.

In one embodiment, the late mode options for handling late timed loopiterations may also be configured dynamically or programmatically. Forexample, the user may connect a wire to the “Mode” property of theconfiguration node 401, where the wire specifies the desired late modeoptions. It is noted that in other embodiments the timed loop may beconfigured to behave according to late modes other than those describedabove. The section below titled, “Modes Defining Behavior for Late TimedLoop Iterations” describes several other late modes in addition to theones discussed above.

As described above, an iteration of the timed loop that takes longerthan the loop's execution period to complete may cause the nextiteration of the loop to begin late. Thus, in one embodiment the conceptof an iteration being late may be based on the execution period of thetimed loop. In one embodiment it may also be desirable to define aseparate deadline to define lateness, where the deadline is differentthan the loop's execution period. For example, the timed loop may havean execution period of 200 μs, but the user may specify a deadline of 80μs for the timed loop. Thus, any iteration that takes longer than 80 μsto complete may overrun the deadline and thus finish late. For someapplications it may be desirable to ensure that loop iterations completewithin a defined deadline that is shorter than the execution period.

As described below, in one embodiment the system may be operable to logtiming data for the timed loop and present a graphical user interfacethat allows the user to view the timing data. Loop iterations thatoverrun the timed loop's deadline may be visually indicated or flaggedto make the user aware of the problem. The user may then makeadjustments as necessary, e.g., by giving the timed loop a higherpriority, changing the functions performed by the loop to make it runfaster, or changing other parts of the graphical program so that they donot expect iterations of the timed loop to complete within such a shortdeadline.

Referring again to FIG. 5, in 307 the graphical program may be executed.In various embodiments the graphical program may be executed on any kindof computer system(s) or reconfigurable hardware, as described above. Asone example, the graphical program may be executed on a computer system82 such as described above with reference to FIGS. 1, 1A, 2A, 2B, and3B.

The time at which the first iteration of the timed loop begins maydepend on the relation of the timed loop to other nodes in the graphicalprogram. In one embodiment the timed loop may begin executingimmediately. In another embodiment, other nodes may have to executefirst before the timed loop can begin execution. For example, in a dataflow graphical program, other nodes may need to execute first to producedata used by the timed loop, such as data to set timing information forthe loop, e.g., data for wires connected to terminals of the input node401 of the timed loop. Thus, in one embodiment one or more ticks of thetiming source for the timed loop may occur, or one or more instances ofevents associated with the timed loop may be generated, without theseticks or events causing the graphical source code associated with thetimed loop to execute or without these ticks or events being countedtoward the offset value specified for the timed loop. In other words,the ticks or event(s) associated with the timed loop may cause the timedloop to iterate only after the timed loop is ready for execution. Thus,with respect to timing of the timed loop, the timing source for thetimed loop may effectively “start” when the timed loop is ready forexecution, even though actual ticks or events associated with the timingsource may occur before then.

Once the timed loop begins execution, the timing source and executionperiod of the timed loop may control the rate at which the timed loopexecutes. Ticks or pulses of the timing source may occur duringexecution of the graphical program, or an event associated with thetimed loop may be generated multiple times during execution of thegraphical program. As described above, the timed loop may be configuredto iterate based on the ticks or based on the generated events, e.g., anew iteration of the timed loop may begin in response to each Nth tickof the timing source or in response to every Nth time the associatedevent is generated. At each iteration of the timed loop, the graphicalsource code associated with the timed loop may be executed, as describedabove with reference to 303. The graphical source code associated withthe loop may be operable to perform any desired operation.

In one embodiment the graphical program may include multiple timed loopsthat can execute concurrently. The multiple timed loops may enable thegraphical program to perform multiple timed activities and control thetiming for each activity. The priorities of the respective loops may beutilized to implement a preemptive execution model. In one embodiment,the highest priority loop which is ready to execute may preempt alllower priority loops. In one embodiment each timed loop may be executedas a separate thread.

Different timed loops may utilize different timing sources, or multipletimed loops may utilize the same timing source. As noted above, in oneembodiment the user may specify a source name for the timing source of aloop to identify a particular instance of the timing source. If twotimed loops are configured with the same source name for the same timingsource, then both loops may share the same instance of the timingsource. In this case, timing information such as the offset for eachloop is relative to the same starting point. However, two timed loopswith different names for the same timing source may be governed bydifferent instances of the timing source. In this case, timing of thetwo timed loops may be independent.

The functionality of receiving notification of the generated events orticks of the timing source and causing a timed loop to iterate inresponse may be implemented in any way, e.g., depending on theparticular graphical programming development environment used to createthe graphical program and depending on the particular type of timingsource or events. For example, in one embodiment, the graphical programmay execute under the management of an execution subsystem of thegraphical programming development environment, and the executionsubsystem may intercept events as they are generated and may invokeexecution of the graphical source code associated with the timed loop.The execution subsystem may interface with other software on thecomputer system to intercept or receive notification of the ticks orevents associated with the timed loop. As one example, where the timedloop is configured to iterate in response to an event generated by adata acquisition (DAQ) device, the execution subsystem may interfacewith DAQ software to receive notification of the event.

In one embodiment the execution subsystem may include a timed loopscheduler that manages the execution of timed loops. Based on the timingsource type and hardware capability, all or some of the eventsassociated with a timed loop may generate interrupts that notify thetimed loop scheduler that an event or a timeout occurred. The timed loopscheduler may handle the interrupt, check the list of timed loopsassociated with the timing source, and trigger a new iteration of atimed loop if necessary. If there are multiple timed loops, the timedloop scheduler may use the priority value of the timed loop that istriggered to determine if the timed loop should preempt a currentlyexecuting loop iteration of another timed loop. The timed loop schedulermay also control which timed loop continues its execution after thecurrently executing timed loop finishes its iteration. The scheduler mayalso reconfigure a hardware component of the timing source for the nextnotification.

In another embodiment, the graphical program may not execute under anexecution subsystem of the graphical programming developmentenvironment, but may execute independently. In this case, for example,when executable code for the graphical program is created, code operableto intercept or receive notification of the events may be linked in withthe graphical program.

In various embodiments, a timed loop may stop executing in response toany of various conditions. In one embodiment, the timed loop may includea portion of graphical source code that is executed at each iteration ofthe timed loop, where the graphical source code represents logic tocontrol whether or not the timed loop continues executing. For example,if the logic evaluates to a Boolean False value, the timed loop may stopexecuting, similarly to a While loop in the C programming language. Inanother embodiment, the timed loop may be configured to execute for aspecific number of iterations and then stop, similarly to a For loop inthe C programming language.

In another embodiment execution of a timed loop may be abortedprogrammatically through an application programming interface (API)call. For example, in one embodiment the graphical programmingdevelopment environment may provide a “Stop Timed Loop” node that theuser can include in a graphical program. The user may configure the“Stop Timed Loop” node with the names of one or more timed loops toabort. When the “Stop Timed Loop” executes during execution of thegraphical program it may cause the referenced timed loops to abortexecution, i.e., to stop iterating. The “Stop Timed Loop” node may belocated anywhere within the block diagram of the graphical program,e.g., may be located outside any timed loop. Thus in one embodiment anode that is external to a timed loop may execute to cause the timedloop to abort.

In one embodiment a timed loop may be passed a “wakeup reason” each timean iteration of the loop begins executing, i.e., a data item indicatingthe reason the iteration of the timed loop began executing. For example,as described below, the wakeup reason may be received via a terminal inthe left data node 402. The normal wakeup reason (e.g., value=0) mayindicate that the iteration began because it was normally scheduled atthat time. There may be other reasons the iteration began. Inparticular, if the timed loop is aborted through an API call asdescribed above then the timed loop may be awakened, i.e., a finaliteration of the timed loop may begin, and the timed loop may be passeda wakeup reason indicating that the reason this final iteration began isbecause of the abort call. The user may configure the graphical sourcecode of the timed loop to check the wakeup reason and to execute cleanupcode if necessary when the timed loop is aborted in this manner.

In one embodiment, operation of the timed loop may be dynamicallychanged during execution of the graphical program. For example, timinginformation for the timed loop such as its period, offset, etc., may bedynamically changed. In various embodiments, the timing information maybe changed using any of various techniques. In one embodiment the timedloop may include special data nodes that may be utilized for thispurpose. For example, the timed loop of FIG. 6 illustrates a left datanode 402 attached to the left border of the timed loop and a right datanode 403 attached to the right border of the timed loop. The left datanode 402 may provide timing and status information about the currentand/or previous loop iteration, such as if the iteration executed late,the time the iteration actually started executing, and when theiteration should have started executing. The user can wire data from theleft data node 402 to the right data node 403 to cause future iterationsof the timed loop to be dynamically configured during execution of thegraphical program.

In various embodiments the left data node 402 may return any kind ofdata regarding execution of the timed loop, e.g., data regardingexecution of the previous iteration of the timed loop or data specifyingcurrent property values, such as the current execution period, priority,offset, etc., of the timed loop. In one embodiment the left data node402 may include a plurality of terminals, each corresponding to adifferent data item. For example, each data item may be represented as aseparate row or field in the left data node 402. The user may be able toconfigure the left data node 402 to display only the data items ofinterest, similarly as described above with reference to theconfiguration node 401.

The user may connect wires to the terminals of the left data node 402 toreceive the respective values of the data items. The wires may providethe data item values to other nodes within the timed loop and/or to theright data node 403. As one simple example, the user may connect one endof a wire to a terminal in the left data node 402 to receive the currentoffset value of the timed loop and may connect the other end of the wireto an Add function node within the timed loop border. The Add functionnode may be configured to add a numeric constant, e.g., 10, to theoffset, and the output of the Add function node may be connected to anappropriate terminal in the right data node 403. (The right data node403 may include a plurality of terminals corresponding to various dataitems regarding execution of the timed loop, similarly as describedabove for the left data node 402.) Thus, in this simple example, theoffset of the timed loop may be dynamically increased by 10 ticks of thetiming source on each loop iteration. Future scheduling of the timedloop may take the dynamically changed timed loop properties intoaccount, i.e., so that subsequent iterations of the timed loop executeaccording to a new dynamically specified period, offset, priority, etc.

A few examples of information that may be received from terminals in theleft data node 402 follow:

-   -   Actual Start of Current Iteration: The actual time at the        beginning of the current iteration.    -   Expected Start of Current Iteration: The time for which the        current iteration was scheduled to be started.    -   Actual Start of Previous Iteration: The actual time at the        beginning of the previous iteration.    -   Expected Start of Previous Iteration: The time for which the        previous iteration was scheduled to be started.    -   Actual End of Previous Iteration: The actual time the previous        iteration finished executing. (This value may be zero for the        first iteration of the loop.)    -   Expected End of Previous Iteration: The time the previous        iteration was expected to finish executing. (This value may be        zero for the first iteration of the loop.)    -   Previous RT: A Boolean value that evaluates to True if Actual        End of Previous Iteration is greater than or equal to Expected        Start of Current Iteration (i.e., True if the last iteration        overran the period).    -   Error: An error flag for the previous iteration.    -   Period: The period of the current iteration.    -   Offset: The offset of the current iteration.    -   Priority: The priority of the current iteration.    -   Wakeup Reason: An integer which indicates the reason the        iteration of the timed loop began executing. The normal reason        (e.g., value=0) is because the iteration was normally scheduled        at that time. There may be other reasons the iteration began.        For example, in one embodiment an asynchronous message to wakeup        may be received from outside the loop. In another embodiment the        loop may be awakened (i.e., may be triggered to iterate) because        it was programmatically aborted. In another embodiment the loop        may be awakened because an associated timeout expired.

As described above, the right data node 403 may be utilized to set newtiming information for the next iteration of the timed loop. As oneexample, the user may utilize the “Previous RT” value from the left datanode 402 to determine whether the last iteration of the timed loopoverran the period. If so, the right data node 403 may be used to set alonger period for the timed loop. Similarly as for the left data node402, the right data node 403 may include a plurality of terminals, eachcorresponding to a different data item. The user may connect wires tothese terminals to set desired properties regarding execution of thetimed loop. In one embodiment, the right data node 403 may includeterminals for setting properties such as:

-   -   Period: The new period of the timed loop. The scheduled start        time for the next iteration of the loop may be based on the new        period.    -   Offset: The new offset of the timed loop.    -   Priority: The new priority of the timed loop.

In one embodiment, the timed loop may be operable to pass on error orstatus information to other nodes in the graphical program. In theexample of FIG. 6, the timed loop includes an output node 404. Theoutput node 404 may return error information that the timed loopreceives in the “Error In” input of the input node 401 or may returnerror information that the timed loop itself generates during aniteration. For example, in one embodiment, if an external source causesthe execution of the timed loop to abort then the output node 404returns an error. In one embodiment the output node 404 does not returnerror information from any subdiagram that executes within the timedloop. In one embodiment, if the timed loop receives an error in the“Error In” input of the input node 401 then the timed loop may notexecute (i.e., the graphical source code associated with the timed loopmay not be executed), and the timed loop may simply pass on the error.

In one embodiment the graphical programming development environment mayallow the user to create a graphical program that utilizes nested timedloops. As described above, the user may include a first timed loop inthe graphical program and may include graphical source code associatedwith the first timed loop such that the graphical source code isexecuted during each iteration of the first timed loop. In oneembodiment a second timed loop may be included in the graphical sourcecode associated with the first timed loop. The user may also associategraphical source code with the second timed loop. The user may configurethe first timed loop to execute according to a first execution period(and other timing information for the first timed loop) and configurethe second timed loop to execute according to a second execution period(and other timing information for the second timed loop), e.g., wherethe first execution period is relatively longer than the secondexecution period. Thus, during each iteration of the first timed loop,the second timed loop may be scheduled to iterate multiple timesaccording to the second execution period and other timing informationfor the second timed loop.

In some cases the user may have a graphical program that includes one ormore non-timed loops which the user desires to convert to timed loops.For example, the LabVIEW graphical programming development environmentprovides non-timed While loops for use in graphical programs. In oneembodiment the graphical programming development environment may providea feature for automatically replacing a While loop or other non-timedloop with a timed loop. For example, the user may invoke a context menuof the While loop such as illustrated in FIG. 9 and may select the“Replace with Timed Loop” option to cause the loop to be automaticallyreplaced. The user may then configure the new timed loop with timinginformation as desired. Graphical source code associated with the oldloop may be preserved when the loop is replaced with the timed loop.Similarly, in one embodiment the user may invoke a command toautomatically replace a timed loop with a While loop or other non-timedloop.

In various embodiments, controlling the timing of a timed loop in agraphical program in the manner described above may be implemented inany of various ways. In one embodiment, the graphical program mayexecute under control of an execution subsystem. The execution subsystemmay utilize a scheduler operable to control timing of timed loops in thegraphical program, as described above.

In one embodiment, the execution of a timed loop may be governed by analarm. The timed loop may set up an alarm with the scheduler before theloop begins execution. The alarm may comprise a wakeup event registeredwith the scheduler. The alarm may be created by specifying a timingsource, period, offset, and priority. There may be many alarms based onthe same timing source.

Upon beginning execution, the timed loop may wait on its scheduledalarm. The scheduler may then fire the alarm at the appropriate time,causing the graphical source code associated with the loop to executefor one iteration. The scheduler may be operable to periodically firethe alarm, where each firing time is determined based on the timingsource, period, offset, and priority, as described above. Thus, aftereach iteration, the timed loop may wait for the next firing of thealarm. If the execution of the loop is terminated (e.g., due toconditional termination logic of the loop), the alarm may be deleted.

In various embodiments, a graphical program that utilizes one or moretimed loops such as described above may perform any function. In oneembodiment the graphical program may include functionality for modelingor simulating a system. The timed loop(s) may be utilized in modeling orsimulating the system. In other embodiments the graphical program mayexecute one or more timed loops to perform other functions. As a fewexamples, the timed loops may be involved in performing an industrialautomation function, a process control function, or a test andmeasurement function, a real-time application, or any other desiredfunction or application.

It is noted that in one embodiment, timed loops such as described abovemay be used to coordinate activities performed by different graphicalprograms. For example, a first graphical program may include a firstloop timed based on a first timing source. A second graphical programmay include a second loop that is also timed based on the first timingsource. Thus, the two timed loops may be synchronized with respect to acommon timing source. In one embodiment, both graphical programs mayexecute on the same computer system. In another embodiment, the firstgraphical program may execute on a first computer system (e.g., thecomputer system 82 of FIG. 1A), and the second graphical program mayexecute on a second computer system (e.g., the computer system 90 ofFIG. 1A). For example, the two computer systems may be coupled via anetwork, and the first timing source may be accessible to both computersystems.

It is noted that FIG. 5 represents one embodiment of a method forconfiguring a graphical program to repetitively perform a process attimed intervals, and other embodiments are contemplated. In variousembodiments, any of various methods may be used to configure thegraphical program with one or more nodes operable to periodicallyperform first functionality at times determined by an execution period.Some embodiments may not comprise displaying a loop icon in thegraphical program. For example, in one embodiment the user may create agraphical sub-program operable to perform the first functionality. Forexample, the graphical sub-program may have its own block diagram onwhich the user arranges a plurality of interconnected nodes to implementthe first functionality. The graphical program may be configured toperiodically execute the graphical sub-program according to a timedexecution period. For example, the graphical sub-program may berepresented as a sub-program node in the block diagram of the graphicalprogram, where the sub-program node is executed according to theexecution period. The user may interact with the sub-program node tospecify timing information, e.g., by using a configuration dialog or byconnecting one or more wires to the sub-program node in a manner similarto that described above.

A graphical programming development environment which allows users tocreate graphical programs that utilize timed loops such as describedabove may comprise a powerful and flexible means for developing a widevariety of applications. For example, users may include multiple timedloops in a graphical program to develop a multi-rate application. Invarious embodiments the graphical programming development environmentmay allow any number of timed loops to be included in a graphicalprogram. In one embodiment the number may be limited to a maximumnumber, e.g., 128. Each timed loop may have a unique timing source ormay share the same timing source as one or more other timed loops. Eachtimed loop may have its own execution period. For example, all the timedloops may execute at different rates, or one or more timed loops mayexecute at the same rate. The user may configure the timed loops withdesired execution periods and offsets to align the timing of the loopiterations in whatever manner desired.

The graphical programming development environment may enable the user toutilize a wide variety of timing sources to generate the ticks or eventsupon which loop execution is based. For example, in one embodiment thetiming source may enable iterations of the loop to be preciselyscheduled with respect to time, e.g., according to a 1 MHz or 1 KHzclock, or precisely with respect to events generated by a hardwaredevice. In one embodiment the timing source may enable iterations of theloop to occur in response to events that may not occur regularly intime, as described above. The capability to align execution of loopsprecisely with respect to various kinds of timing sources (and withrespect to each other) may be important for many applications.

The graphical programming development environment may also enable theuser to configure multiple timed loops to execute at differentpriorities, e.g., in accordance with the relative importance of eachtimed loop. The graphical programming development environment may alsoenable the user to configure timing information for a timed loop to bedynamically changed during execution of the graphical program.

FIG. 10—Timing Relationships Among Individual Nodes

For many applications, it may be desirable to control timingrelationships among individual nodes in the graphical program. FIG. 10is a flowchart diagram illustrating one embodiment of a method forspecifying timing relationships among nodes in a graphical program. Itis noted that FIG. 10 illustrates a representative embodiment, andalternative embodiments are contemplated. Also, various elements may becombined, omitted, or performed in different orders. The method shown inFIG. 10 may be used in conjunction with any of the computer systems ordevices shown in the above Figures, among other devices.

A user may first create the graphical program, e.g., by interacting witha graphical programming development environment. As shown in 351, aplurality of nodes may be arranged on a display in response to userinput. In 353, the plurality of nodes may be interconnected in responseto user input. The nodes may be interconnected in one or more of a dataflow, control flow, or execution flow format. The plurality ofinterconnected nodes may visually indicate functionality of thegraphical program.

In 355, user input specifying desired timing of a first node withrespect to timing of a second node may be received. The user input mayspecify a desired timing relationship between execution of the firstnode and execution of the second node, to be satisfied during executionof the graphical program. In various embodiments, any kind of timingrelationship or timing constraint between the first node and the secondnode may be specified.

In one embodiment, the user input may specify desired timing of anexecution point for the first node with respect to timing of anexecution point for the second node. As used herein, an execution pointfor a node may refer to an identifiable point in time pertaining toexecution of the node during execution of the graphical program or mayrefer to a time pertaining to execution of the node at which a specificcondition is or becomes true. One example of an execution point is thebeginning of execution of the node. During execution of a graphicalprogram, a given node may begin execution at a time which is typicallydependent upon the node's relationship or connections to other nodes inthe graphical program. For example, in a data flow graphical program, anode may begin execution when all data flow dependencies for the node(if any) have been satisfied. The node may then execute for an amount oftime which depends on functionality of the node or operations performedby the node, after which execution of the node ends. The point at whichexecution of the node ends is another example of an execution point forthe node, i.e., an identifiable point in time pertaining to execution ofthe node.

In various embodiments, the user input received in 355 may specify anytype of timing relationship or timing constraint between any kinds ofexecution points for the respective nodes. For example, the user mayspecify a time interval to elapse between the time at which the firstnode begins execution and the time at which the second node beginsexecution. For example, the user may specify a time interval of 100 msto indicate that 100 ms should elapse between the times at which therespective nodes begin execution. As another example, the user mayspecify a time interval to elapse between the time at which the firstnode ends execution and the time at which the second node endsexecution. As another example, the user may specify a time interval toelapse between the time at which the first node ends execution and thetime at which the second node begins execution, or vice versa.

In another embodiment the user input may specify a maximum amount oftime to elapse between an execution point for the first node and anexecution point for the second node. For example, the user input mayspecify that no more than 50 ms should elapse between the time at whichthe first node begins execution and the time at which the second nodebegins execution. In another embodiment the user input may specify aminimum amount of time to elapse between an execution point for thefirst node and an execution point for the second node. For example, theuser input may specify that at least 200 ms should elapse between thetime at which the first node ends execution and the time at which thesecond node begins execution.

Besides specifying timing relationships relating to the beginning ofexecution and the end of execution for the nodes, the user input mayalso specify timing relationships relating to any other execution pointfor the nodes. For example, where the first node has an execution sideeffect, the user input may specify a maximum amount of time to elapsebetween the time at which the side effect of the first node occurs andthe time at which the second node begins execution. As another example,the user input may specify a desired time interval to elapse between thetime at which a side effect of the first node occurs and the time atwhich a side effect of the second node occurs. In various embodiments,the first node or the second node may have any execution side effect.For example, the side effect may be caused by an input/output operationor may be caused by a processor executing the graphical programinteracting with a separate hardware device.

In one embodiment, the timing relationship specified in 355 may beassociated with a particular timing source or clock, similarly as thetimed loop described above may be associated with a timing source orclock. Thus, in one embodiment, rather than specifying a time intervalsuch as 100 ms, the user may specify a number of ticks, e.g., 100. Thetiming constraint between the first node and the second node may then bebased on the specified number of ticks of the associated timing source.

In 357, timing information may be displayed on the display to visuallyindicate the timing of the first node with respect to timing of thesecond node. In various embodiments the timing information may visuallyindicate the timing of the first node with respect to timing of thesecond node in any way. In one embodiment the timing information may bedisplayed on the block diagram of the graphical program. In anotherembodiment the timing information may be displayed separately from theblock diagram.

Where the user input in 355 specifies a numerical time value regardingtiming of the first node with respect to timing of the second node,displaying the timing information may include displaying this numericaltime value. Displaying the timing information may also includeindicating whether the numerical time value is an exact time interval, atime maximum, or a time minimum. For example, where the user specifies atime maximum of 100 ms to elapse between an execution point for thefirst node and an execution point for the second node, this may beindicated by displaying text such as “<100 ms” or “max 100 ms”, e.g.,where the text is displayed or positioned in relation to the first nodeand the second node to visually indicate that a timing relationshipbetween the first node and the second node is represented.

In one embodiment, displaying the timing information may comprisedisplaying a timing wire between the first node and the second node. Oneend of the timing wire may be connected to the first node, and the otherend may be connected to the second node. The specific time constraintmay also be displayed with or displayed on the timing wire. For example,FIG. 11 illustrates an exemplary timing wire between a “Read” node and a“Write” node, where the timing wire visually indicates that 100 ticks ofa timing source should elapse between the time when the “Read” nodebegins execution and the time when the “Write” node ends execution. Inthis example, a “PID” node is executed between the “Read” node and the“Write” node.

The timing wire may be a special wire that does not have the samemeaning as other wires in the graphical program. For example, in a dataflow graphical program, the graphical program may include a plurality ofwires that indicate data flow between nodes in the graphical program.However, the timing wire may not indicate data flow between the firstnode and the second node, but instead may indicate a timing relationshipto be satisfied during execution of the graphical program.

In one embodiment, a node may have a plurality of points operable toaccept connection of a timing wire. Each point may correspond to adifferent execution point for the node. Thus, the timing relationshipspecified by the timing wire may depend on (and may be visuallyindicated by) the particular points to which the timing wire is attachedon the respective nodes. In one embodiment, the left side of a node maycorrespond to the beginning of execution of the node, the right side ofthe node may correspond to the end of execution of the node, and themiddle of the node may correspond to the point when an execution sideeffect of the node occurs. Thus, in FIG. 11, the timing wire is attachedto the left side of the “Read” node and the right side of the “Write”node to indicate that a timing relationship is specified between thebeginning of execution of the “Read” node and the end of execution ofthe “Write” node. FIG. 12 illustrates a similar example in which atiming wire is attached to the middle of the “Read” node and the middleof the “Write” node. Thus, the timing wire of FIG. 12 specifies adifferent timing relationship, i.e., a time interval of 100 ticksbetween the time at which a side effect (input operation) of the “Read”node occurs and the time at which a side effect (output operation) ofthe “Write” node occurs.

In other embodiments, timing information for the first node and thesecond node may be displayed using techniques other than timing wires.FIG. 13 illustrates one alternative embodiment which illustrates thesame timing relationship as FIG. 11.

It is noted that 355 and 357 may occur in various orders. For example,in one embodiment the user may first specify the timing relationshipbetween the first node and the second node by interacting with a dialogbox or wizard, and the timing information (e.g., timing wire) may thenbe displayed in response. In another embodiment, the user may firstcause a timing wire (or other structure representing timing information)to be displayed in the graphical program and may then configure thetiming wire with information specifying a timing relationship.

In 359, the graphical program may be executed. The graphical program maybe executed in such a way that the visually indicated timing of thefirst node with respect to timing of the second node is satisfied. Thismay involve scheduling execution of nodes in the graphical program in aparticular way or adjusting priorities of one or more threads in thegraphical program so that the timing relationship is satisfied. It ispossible that the user may specify a timing relationship that cannot besatisfied. In one embodiment it may be possible to determine beforeexecution of the graphical program that the timing relationship cannotbe satisfied. If so, then the graphical programming developmentenvironment may inform the user, e.g., at compile time or at the timethe user specifies the timing relationship while editing the graphicalprogram. In another embodiment, the system may determine duringexecution of the graphical program that the timing relationship cannotbe satisfied and may inform the user as the graphical program executesor after the graphical program finishes executing. In another embodimentthe user may determine whether the specified timing relationships weresatisfied by utilizing a visualization tool to view timing of thegraphical program, as described below.

In various embodiments, the user may specify a timing relationship forany of various types of nodes located anywhere within the graphicalprogram. As described above, the graphical program may include one ormore loops which have associated nodes that are executed for a pluralityof iterations. In one embodiment the first node and the second node maybe associated with or located within a loop. Thus, for each iteration ofthe loop, execution of the first node and the second node may be timedso that the visually indicated timing relationship is satisfied. FIG. 14illustrates the portion of graphical source code illustrated in FIG. 11,where the graphical source code is executed in a timed loop. Thus, foreach iteration of the loop, the “Write” node ends execution 100 ticksafter the “Read” node began execution. In this example, the timingsource used to measure the 100-tick interval is the same as the timingsource for the timed loop.

In another embodiment, the user may specify a timing relationshipbetween a node in the loop and the loop itself. For example, the usermay specify that execution of a first node should begin 50 ms after eachiteration of the loop begins. For example, this may be indicated by atiming wire similarly as described above, where one end of the timingwire is connected to the loop border and the other end is connected tothe first node.

The system may attempt to schedule execution of the nodes so that thetiming relationship is satisfied from the beginning of execution of theloop. In one embodiment the timing relationship may not be satisfied forthe first few iterations of the loop, e.g., due to incomplete knowledgeof execution times of the first node, the second node, or intermediatenodes executed between the first node and the second node. However, thesystem may be operable to analyze the timing of previous iterations andadjust scheduling so that the timing relationship is satisfied forsubsequent iterations of the loop.

In one embodiment, a timing relationship between a first node and asecond node may be dynamically modified during execution of thegraphical program. For example, where a time interval of 15 ms isoriginally specified between an execution point of a first node and anexecution point of a second node, the interval may be dynamicallyincreased to 20 ms. For example, the graphical program may includegraphical source code operable to dynamically determine the actualtiming of nodes that occurs during execution of the graphical programand dynamically adjust various timing relationships as necessary so thatthe graphical program executes with the proper timing. As anotherexample, the actual time interval that occurs between two executionpoints of two nodes may be dynamically determined, and the executionperiod of a timed loop in the graphical program could be dynamically setto this time interval, similarly as described above with reference toFIG. 5.

FIG. 15—Visualization Tool

It may be desirable to enable the user to view various aspects of thetiming of a graphical program. FIG. 15 is a flowchart diagramillustrating one embodiment of a method for viewing timing of one ormore loops in a graphical program. It is noted that FIG. 15 illustratesa representative embodiment, and alternative embodiments arecontemplated. Also, various elements may be combined, omitted, orperformed in different orders. The method shown in FIG. 15 may be usedin conjunction with any of the computer systems or devices shown in theabove Figures, among other devices.

In 501 a graphical program having one or more loops may be created. Inone embodiment the one or more loops may include one or more timedloops, i.e., the loops may be configured to execute according toparticular execution periods. In another embodiment the graphicalprogram may also or may alternatively include one or more non-timedloops.

In 503 the graphical program may be executed.

In 505 timing analysis data regarding timing of the one or more loopsduring execution of the graphical program may be stored. The timinganalysis data may include any kind of data useable to analyze timing ofthe one or more loops. For example, for each of the one or more loops,the timing analysis data may include data such as the time at which eachiteration of the loop began and the time at which each iteration of theloop ended. In other embodiments, timing analysis data regarding otheraspects of the timing of the graphical program may be stored, such astiming data for individual nodes in the graphical program. For example,the timing analysis data may include data specifying the time at which afirst node began and ended execution (or specifying each time the firstnode began and ended execution, if the first node is performed within aloop).

In various embodiments, the timing analysis data may be stored at anylocation, such as on a computer system on which the graphical program isexecuted or on another computer system to which the timing analysis datais transferred via a network. Also, the timing analysis data may bestored on any kind of memory medium. Storage of the timing analysis datamay occur concurrently with and/or after execution of the graphicalprogram.

In one embodiment, timing analysis data may not be stored for everyiteration of every loop. For example, in one embodiment timing analysisdata may be stored until a configurable maximum amount of storage spacehas been utilized or until an out-of-storage situation occurs. After themaximum has been utilized, storage of timing analysis data may stop, orpreviously stored timing analysis data may be overwritten. In anotherembodiment the user may be able to interactively request storage of thetiming analysis data to start or stop as the graphical program is beingexecuted. In another embodiment the user may be able to specify whichloops in the graphical program to store timing analysis data for. Forexample, the FIG. 8 configuration dialog for specifying timinginformation for a timed loop has a checkbox for specifying whether ornot to log timing data for the timed loop.

In 507 a graphical user interface (GUI) for viewing timing of the one ormore loops during execution of the graphical program may be displayed.For example, the GUI may be associated with a visualization tooloperable to receive the timing analysis data stored in 505 and displaythe timing analysis data or display information computed based on thetiming analysis data. In one embodiment the GUI may be displayed on adisplay of the same computer system on which the graphical programexecutes. In another embodiment the GUI may be displayed on a display ofa different computer system. As one example, the graphical program mayexecute on a first device, and a visualization tool may execute on adesktop computer system coupled to the first device via a network.

In one embodiment the user may view the timing data for the one or moreloops “offline” from the graphical program, e.g., after execution of thegraphical program has ended. In another embodiment the GUI may bedisplayed simultaneously as the graphical program is executing and maybe continuously updated with new timing data so that the user can seethe timing data of the one or more loops in real-time or with a smalltime delay.

In various embodiments the GUI may display any of various kinds ofinformation regarding timing of the one or more loops, and any kind ofvisual presentation may be used in displaying the information. (Asdescribed below, in other embodiments the GUI may display information tographically indicate other types of timing for the graphical program inaddition to or alternatively to the timing of loops in the graphicalprogram.) The GUI may display absolute and/or relative timing data. TheGUI may display information enabling the user to see timing ofindividual iterations of the one or more loops performed duringexecution of the graphical program. For example, information visuallyindicating a start time and an end time for each iteration and/or a timeduration for each iteration may be displayed. If the loops are assignedexecution priorities, the GUI may also indicate the respectivepriorities, e.g., using a color-coding scheme.

In one embodiment the GUI may indicate the timing of the loop iterationsby displaying time increments along a first axis. Each individual loopiteration may be represented as one or more bars, line segments, orother indicators along the first axis. The length of each bar or linesegment may represent a time duration for which the loop iterationexecuted. The start and end points of the bar or line segment mayrepresent start and end times for the loop iteration. FIG. 16illustrates one exemplary GUI in which various bars represents times atwhich the corresponding loops were executing.

In one embodiment timing data may be displayed separately for each loop.In another embodiment the GUI may combine information for multipleloops. For example, the GUI may visually indicate timing of multipleloops relative to each other and may indicate execution transitionsbetween the loops, e.g., as in the example of FIG. 16. Where multipleloops execute based on a common timing source, the GUI may displayinformation visually indicating timing of the multiple loops withrespect to the common timing source. The GUI may display informationthat allows the user to distinguish the various loops from one another.In one embodiment, the user may configure each loop with a loop name,e.g., when creating the graphical program, and the GUI may display theloop names to enable the user to identify the respective loops. Forexample, in FIG. 16 the user may have named the three loops, “backgroundloop”, “time-critical loop”, and “normal priority loop”. FIG. 16 alsoillustrates a scheduler task that schedules execution of the loops.

In the example of FIG. 16, each vertical line indicates a point in timewhen execution switched from one task to another. In this example, theGUI displays color-coded flags to provide information about eachtransition to or from a loop iteration. A green flag indicates that theloop iteration started at that point, a yellow flag indicates that theloop iteration was suspended at that point, a blue flag indicates thatthe loop iteration was resumed at that point, and a red flag indicatesthat the loop iteration finished at that point. If a loop iteration wassuspended at some point and later resumed, then that loop iteration maybe represented by multiple bars on the GUI. The green and red flags mayvisually indicate when the loop iteration first began and finally ended.In another embodiment the displayed flags may be shape-coded instead ofor in addition to being color-coded. In addition to the informationnoted above, flags or other indicators may be utilized to visuallyindicate any of various other kinds of information regarding timing of aloop. For example, colored flags may also be displayed to indicateiterations of the loop that occurred late, i.e., loop iterations thatbegan at a later time than they were supposed to. For example, a lateflag may appear on the GUI at a position indicating the actual time thatan iteration began execution and may visually indicate that the actualtime was later than a time when the iteration was scheduled to begin.

In one embodiment the GUI may be large enough to display only a portionof the timing data at a time. The user may adjust which portion of thetiming data is displayed, e.g., by scrolling a window to bring thedesired portion into view. In one embodiment the user may be able toadjust the scale at which the timing data is displayed.

In some applications, the graphical program may be operable to performnetwork communication, i.e., may receive and/or send data over anetwork. In one embodiment the GUI may display information tographically indicate timing of the network communication together withthe timing of the loops in the graphical program. This may enable theuser to understand when the network communication occurs relative toiterations of the loops. FIG. 17 illustrates a GUI similar to that ofFIG. 16, where another row has been added to indicate timing of networkcommunication performed by the graphical program, relative to loopiterations performed by the graphical program.

In one embodiment the GUI may display timing of one or more loops of asingle graphical program. In another embodiment the GUI may displaytiming of loops that execute in multiple graphical programs. Forexample, the GUI may display timing of a first one or more loops thatexecute in a first graphical program and a second one or more loops thatexecute in a second graphical program. Timing for any number of loops inany number of graphical programs may be displayed.

FIG. 17A illustrates a GUI similar to that of FIG. 17, where timing datafor loops executed in two different graphical programs is displayedtogether with timing information indicating network communication inwhich the two graphical programs communicate with each other. In thisexample, the background loop on computing node 1 begins networkcommunication at the point where the vertical bar connects to thenetwork 5 bar. The message is received by a time critical loop executingon computing node 2. It performs some processing and then sends amessage back to computing node 1, where the message is received by thenormal priority loop. In this example, the arrival of the message oncomputing node 2 is what causes the time critical loop to run. Thus thetime critical loop was waiting for the message to come. For example, thetime critical loop may be implemented as an event-triggered loop such asdescribed below. This example also illustrates the use of timed loops indifferent graphical programs to synchronize operation of the programs intime, where the loops execute based on a common timing source.

The GUI screen shots mentioned above are exemplary only. As noted above,in various embodiments, any kind of visual presentation may be used indisplaying timing data of the graphical program(s). FIG. 18 illustratesone alternative embodiment for displaying timing data of a graphicalprogram that performs three loops named “Task A”, “Task B”, and “TaskC”. Times when each loop was executing are indicated in the graphicaldisplay on the left with white line segments. Thus, each white linesegment may correspond to an iteration of a loop. The user may click oneach white line segment to display text information regarding therespective loop iteration in the pane on the right side of the display.

In other embodiments the GUI may visually indicate other types of timingfor the graphical program in addition to or alternatively to the timingfor loops in the graphical program. In one embodiment, the GUI mayvisually indicate timing for individual nodes in the graphical program.As described above with reference to FIG. 10, the user may be able tospecify a desired timing relationship between a first node and a secondnode in the graphical program. Thus, the GUI may visually indicate theactual execution of the first node relative to the actual execution ofthe second node. For example, in one embodiment the actual execution ofthe first node may be indicated by a first length relative to a timeaxis, and the actual execution of the second node may be indicated by asecond length relative to the time axis. Also, the GUI may visuallyindicate timing of an execution point of the first node relative to anexecution point of the second node. For example, if the user specified adesired time interval of 100 ms between the beginning of execution ofthe first node and the beginning of execution of the second node, thenthe GUI may graphically indicate the actual time interval that occurredbetween the beginning of execution of the first node and the beginningof execution of the second node. The GUI may also visually indicate thetimes at which execution side effects of various nodes occurred.

In one embodiment the user may be able to cause the GUI to switchbetween various display modes. For example, one display mode may displaytiming for loops in the graphical program, and another display mode maydisplay timing for individual nodes in the graphical program. In oneembodiment, timing data for both loops and individual nodes may bedisplayed simultaneously. For example, the GUI may visually indicatetiming both of loop iterations and of individual nodes executed withineach loop iteration.

There may be other display modes as well, such as a mode for displayingtiming of threads executed by the graphical program. Other low-levelexecution details for the graphical program may also be displayed, suchas semaphore accesses, critical section accesses, sleep spans, etc. Theuser may also be able to specify viewing preferences to change thedisplayed information. The user may also be able to select which itemsto display information for. For example, timing information for someloops or some nodes may be hidden from view if desired, to simplify thedisplay.

In one embodiment, the GUI may display timing data on the block diagramof the graphical program. This may allow the user to easily relate thetiming data to the corresponding portion of the graphical program and tosee timing characteristics of particular portions of the graphicalprogram. In another embodiment, the GUI may primarily display the timingdata, but certain elements of the block diagram may also be included onthe display. For example, individual nodes may be displayed to enablethe user to easily identify the nodes corresponding to various portionsof the displayed timing data.

The timing data displayed by the GUI may allow the user to determinewhether the timing of the graphical program(s) is occurring as intended.The user may be able to see when particular activities occur in thegraphical program and also get a measure of how much time each activitytakes to execute. An execution subsystem which executes the graphicalprogram may attempt to schedule execution of various elements of thegraphical program so that the specified timing criteria for thegraphical program are met. However, in some cases it may not be possibleto satisfy the timing criteria, e.g., if the user specified executionperiods or time intervals that are too short. If timing is not occurringas intended, then the user may adjust the timing criteria for variouselements of the graphical program. For example, if a loop consistentlyoverruns its execution period, the user may specify a longer executionperiod for the loop. As another example, if a user-specified maximumtime interval between an execution point of a first node and anexecution point of a second node was not satisfied, then the user mayspecify a longer time interval. If timing criteria for other loops ornodes in the graphical program depends on or is relative to the timingcriteria that changed, then the user may also adjust the timing criteriafor these other loops or nodes, so that proper timing relationshipsamong various elements of the graphical program are maintained.

In one embodiment the timing data may be programmatically analyzed toautomatically detect situations where the specified timing criteria ofthe graphical program are not being met. The user may be informed of theproblem, e.g., by displaying a text message or by visually indicating anerror condition on the display, e.g., through color-coding or othertechniques to draw the user's attention to the problem.

In other cases the specified timing criteria for the graphical programmay be satisfied with time to spare, and the user may be able to adjustthe timing criteria to make the graphical program execute faster. Forexample, if the user specified an execution period of 25 ms for a loop,and the GUI indicates that each iteration of the loop took less than 20ms to execute, then the user may adjust the execution period of the loopto 20 ms. In one embodiment the timing data may be analyzed toautomatically detect situations where the specified timing criteria canbe changed to make the graphical program execute faster.

In one embodiment the GUI may not only display timing data, but may alsoallow the timing criteria for the graphical program to be re-configuredfrom within the GUI itself, without having to switch to a block diagrameditor or other context. For example, the user may double-click on aportion of timing data displayed for a particular loop to cause aconfiguration dialog for setting timing information for the loop to bedisplayed. The user may then change various aspects of the loop's timinginformation, such as its execution period, offset, priority, etc. Thegraphical program may then be configured with the new timing informationfor the loop. In one embodiment this may comprise automatically orprogrammatically changing a portion of the graphical program's blockdiagram, e.g., to set new numerical values used on the block diagram, orto re-configure wires, etc.

In one embodiment the graphical program may be re-configured with thenew timing information “offline”, i.e., while the graphical program isnot being executed. For example, the graphical program may then bere-compiled and executed again to determine whether the new timinginformation is appropriate. In another embodiment the graphical programmay be re-configured with the new timing information dynamically, as thegraphical program is being executed. The GUI may be continuously updatedwith new timing data so that the user can see the effects of the newtiming configuration in real-time or with a small time delay.

In another embodiment the GUI may allow the user to easily switch fromthe GUI to a block diagram editor for editing the graphical program. Forexample, the user may be able to issue a command to cause the blockdiagram editor to be launched in a new window and the graphical programto be opened in the editor window. In one embodiment the editor windowmay be automatically scrolled to bring a particular element of thegraphical program into view. For example, the user may double-click on aportion of timing data displayed on the GUI for a particular loop, whichmay cause the graphical program to be opened in the editor andautomatically scrolled so that the loop is in view. The user may thenre-configure the timing information for the loop, e.g., by invoking aconfiguration dialog, or changing wires connected to loop terminals,etc.

In another embodiment the GUI may allow the user to specify settingchanges for one or more hardware devices which the graphical programutilizes. For example, the user may change hardware device settings thataffect the timing of the graphical program. The specified changes to thesettings may be automatically applied to the hardware devices. In oneembodiment, hardware events or status of hardware devices may also bedisplayed along with the timing data for the graphical program. Forexample, information may be displayed to represent when the converterson a DAQ board are ready to be used in sampling data. This may aid theuser in properly aligning the timing of his graphical program with thetiming behavior of the hardware devices which the graphical programutilizes.

An alternative embodiment of the method may be utilized to displaytiming information for a text-based program, such as a program writtenin C, C++, Visual C++, Visual Basic, Java, etc. In particular, where thetext-based program includes one or more loops, the GUI may displaytiming data for the one or more loops in a manner similar to thatdescribed above. For example, for a C program that includes one or moreWhile loops or one or more For loops, the GUI may display timing datafor the one or more While loops or For loops.

FIG. 19—Multiple Timed Loops Grouped in a Hierarchy

In some applications it may be desirable to execute a graphical programhaving multiple timed loops that are timed in a hierarchical fashionwith respect to each other. The timed loops may not all execute at thesame rate but may need to execute at rates which are derived from eachother. As one simple example, it may be desirable to have a first loopthat executes at a rate of 1 MHz and a second loop that executes at arate of 200 KHz, where the 200 KHz timing source for the second loop isderived from the 1 MHz timing source of the first loop. In other words,the timing source for the second loop may need to tick exactly at thesame time as every fifth tick of the timing source for the first loop.Thus, successive iterations of the second loop may begin execution atthe same time as every fifth iteration of the first loop beginsexecution.

In any given application, the number of timed loops in the graphicalprogram and their timing relationships with respect to each other may bearbitrarily complex. During execution of the graphical program it may benecessary to properly align the timing sources of the loops with respectto each other and begin execution of the loops so that they are exactlytimed with respect to each other in the desired manner. FIG. 19 is aflowchart diagram illustrating one embodiment of a method for executinga graphical program which has a plurality of timed loops, wherein thetimed loops utilize timing sources that are related to or derived fromeach other. It is noted that FIG. 19 illustrates a representativeembodiment, and alternative embodiments are contemplated. Also, variouselements may be combined, omitted, or performed in different orders.

According to one embodiment of the method, a graphical program having aplurality of loops may be created, as shown in 601. For example, theuser may include a plurality of timed loops in the graphical program, asdescribed above with reference to FIG. 5.

In 603 a hierarchy of timing sources may be defined. Any type of timingsources may be utilized, such as hardware or software-based timingsources. In one embodiment the timing sources may be related to eachother according to parent/child relationships. For example, one or moretiming sources may be derived from a base timing source. For each timingsource derived from the base timing source, one or more timing sourcesmay in turn be derived from that timing source. Additional timingsources may in turn be derived from these timing sources, and so on, foras many levels as desired. Thus the timing sources may be related toeach other according to a tree hierarchy.

FIG. 20 illustrates an exemplary hierarchy of clocks arranged as a tree.The base clock, Clock A, ticks with a frequency of 1 MHz. Clock B andClock D are derived from Clock A. Clock B has a frequency of 200 KHz andthus ticks on every fifth tick of Clock A. Clock C is derived from ClockB and has a frequency of 100 KHz. Thus Clock C ticks on every other tickof Clock B, or every tenth click of Clock A. Clock D has a frequency of500 KHz and thus ticks on every other tick of Clock A.

In various embodiments, any of various techniques may be utilized todefine the hierarchy of timing sources. In one embodiment the hierarchyof timing sources may be defined based on user input. For example, thegraphical programming development environment may be operable to displaya GUI allowing the user to specify relationships among the timingsources. In another embodiment the user may utilize an applicationprogramming interface (API) to define the hierarchy of timing sources.For example, the user may create graphical source code operable todynamically define the hierarchy of timing sources during execution ofthe graphical program.

In 605 each of the loops in the graphical program may be associated withone of the timing sources defined in 603. Thus the plurality of loopsmay be viewed as a group of loops that are grouped together due to therelationships among their respective timing sources. In variousembodiments the loops may be associated with the timing sources usingany technique, similarly as described above with reference to FIG. 5. Itis noted that 603 and 605 may occur in any order or may occurconcurrently with respect to each other.

In 607 execution of the graphical program may begin. For the group ofloops in the graphical program to execute with the intended timing itmay be necessary to control the manner in which their respective timingsources are started and control when the loops begin executing. As shownin 609, execution of the loops may be delayed until every loop in thegroup is ready to execute. The determination of when the loops are readyto execute may depend on the type of graphical program. For example, fora data flow graphical program, a loop may be ready to execute when alldata flow dependencies for the loop (if any) have been satisfied. As asimple example, consider a graphical program with Loop A whose data flowdependencies become satisfied at time T1, Loop B whose data flowdependencies become satisfied at time T2, and Loop C whose data flowdependencies become satisfied at time T3, where T1<T2<T3. In thisexample, execution of Loops A and B may be delayed until time T3, eventhough Loop A was ready to execute at time T1 and Loop B was ready toexecute at time T2.

After every loop in the group is ready to execute, the timing sourcesfor the various loops may be started. To satisfy the definedrelationships among the timing sources, the timing sources may need tobe started in a certain order. Thus in 611 an ordering for starting thetiming sources may be determined based on their hierarchicalrelationship. In 613 the timing sources may be started according to thisdetermined ordering.

As described above, the timing sources may be related to each otheraccording to a tree hierarchy. The timing sources may be started in anorder depending on their position within the tree. Each child timingsource may be started before its parent timing source. According to oneembodiment, the timing sources may be started according to a post-orderdepth-first traversal of the tree.

As shown in 615, once the timing sources have been started, execution ofthe loops may be begun such that each loop executes based on itsrespective timing source, i.e., iterations of each loop are timed by itsrespective timing source, similarly as described above with reference toFIG. 5.

Modes Defining Behavior for Late Timed Loop Iterations

As discussed above with reference to FIG. 5, in some situations thefirst iteration of a timed loop may not be ready to execute until a timethat is after its designated offset, e.g., due to late arrival of dataflow or other causes. In different applications the user may want thetimed loop to behave in different ways when such a situation occurs. Invarious embodiments the graphical programming development environmentmay enable the user to choose from any of various kinds of modes thatdefine the behavior of a timed loop that is late in this manner. Thissection describes several exemplary late modes according to which thetimed loop may be configured.

As an example, suppose that a timed loop is configured with an executionperiod of 100 ticks and an offset of 30 ticks, and suppose that theactual time required for one iteration of the timed loop to execute is20 ticks. Thus, in normal operation the first iteration of the timedloop should begin at 30 ticks (i.e., its offset), and subsequentiterations should begin at 130 ticks, 230 ticks, 330 ticks, etc., i.e.,as defined by the period (100 ticks). Assume however that the timed loopis not actually ready to begin execution until 240 ticks, e.g., due tolate arrival of data flow. Since the timing source is now at 240 ticksthe scheduler may have choices in scheduling the first and subsequentiterations of the timed loop.

One dimension to the problem is whether or not the timed loop should bealigned with the originally prescribed schedule. In some applications,other timed loops or hardware devices may already be running at theoriginally prescribed schedule. Thus it may be desirable to align thistimed loop with the (already running) global schedule. This means thatthe timed loop should align itself as quickly as possible with itsprescribed schedule. In the example above, the first iteration of thetimed loop should be scheduled to begin at 330 ticks, and subsequentiterations at 430 ticks, 530 ticks, etc. However, in other applicationsit may not be necessary to align this timed loop with the execution ofother timed loops or hardware devices. In these applications it may bedesirable to instead begin executing the timed loop as soon as possible.Thus, the first iteration of the timed loop may begin executionimmediately, using the current time as its actual offset. In the exampleabove, this means that the first iteration of the timed loop beginsexecution at 240 ticks, and subsequent iterations at 340 ticks, 440ticks, etc.

Another dimension to the problem concerns whether the loop should catchup on processing data from missed periods. For example, in oneembodiment the timed loop may be a consumer of data generated by othertimed loops or hardware devices. At each iteration, the timed loop maybe expected to consume or process data generated by the other timedloops or hardware devices. Since the timed loop is late, the other timedloops or hardware devices may already have generated data missed by thistimed loop. In the example above, the timed loop is behind with the datafrom the periods starting at 30 and 130 ticks, and we can assume thatthe data from the current period (starting at 230 ticks) has alreadybeen produced as well. If the data from the missed periods are availablein a buffer, it may be desirable for the timed loop to catch up byprocessing the missed data points before it is ready to join the definedschedule. However, a timed loop that processes the missed data may causejitter, which is the amount of time that a loop cycle time varies fromthe specified schedule. Thus, in some applications the user may not wantthe timed loop to process the missed data. If the user does not want toprocess the missed data, the timed loop can ignore older data in thebuffer that the loop iterations missed and process only the latest data,such as the data available at the next iteration and subsequentiterations.

The two problem dimensions discussed above are orthogonal to each other.Thus, four modes, mode A, mode B, mode C, and mode D, may be defined tospecify the behavior of a late timed loop, as illustrated in FIG. 21.For completeness, two additional modes, mode E and mode F, may also beintroduced. These modes both specify a timed loop that ignores its givenoffset. A timed loop configured in mode E will be scheduled to runimmediately when it is enabled by data flow. A timed loop configured inmode F will be scheduled to run one period later than the time when itis enabled by data flow.

The chart in FIG. 22 illustrates the operation of the timed loop in theabove example when it is configured in each of these six modes. In thischart, X(t) denotes the value being produced (say by a hardware deviceor another timed loop) at time t, and A(t), B(t), C(t), D(t), E(t), andF(t) denote the consumption of the data produced at time t when the loopis configured to behave according to the modes A, B, C, D, E, and F,respectively. For example, when the timed loop is configured in mode A(i.e., Catch Up, Align with Schedule), the timed loop may iterate toprocess the data from the missed periods before it is aligned with theglobal schedule. As shown in FIG. 22, when the timed loop is configuredin mode A, at 240 ticks the timed loop processes the data that wasproduced at 30 ticks, at 260 ticks the timed loop processes the datathat was produced at 130 ticks, and at 280 ticks the timed loopprocesses the data that was produced at 230 ticks. Having processed thedata from the three missed periods, the next iteration of the timed loopis then scheduled to begin at 330 ticks, in line with the globalschedule. Behavior of the loop when it is configured in modes B, C, D,E, and F is shown in a similar manner. In this example, it is assumedthat the timed loop has the highest priority, allowing the timed loop tocatch up as fast as possible.

To more precisely capture the semantics of the modes the followingpseudo-variables may be defined, mapping iteration count to their valuesfor that iteration: expected_wakeup: N -> Time (Computed at thebeginning of each iteration) scheduled_run: N -> Time (Computed at thebeginning of each iteration) iterations_behind: N -> N (Computed at thebeginning of each iteration) actual_wakeup: N -> Time (Generated by thesystem) offset: N -> Time (Specified at the beginning of each iteration)period: N -> Time (Specified at the beginning of each iteration)

Invariants:  (All n: n>=0: expected_wakeup(n) <= actual_wakeup(n)  <=scheduled_run(n) (Not mode F and F′)   AND  expected_wakeup(n) <expected_wakeup(n+1)   AND  actual_wakeup(n) < actual_wakeup(n+1)   AND scheduled_run(n) < scheduled_run(n+1)  ) iterations_behind(0) = (min j:j >= 0: offset(0) + j*period(0) >= actual_wakeup(0) )iterations_behind(n+1) = (min j: j >= 0: expected_wakeup(n+1) +j*period(n+1) >= actual_wakeup(n+1) )

Mode A (Wait Multiple, Process Pending): expected_wakeup(n) = offset(0), if n=0   expected_wakeup(n−1) + period(n), if n>0  offset(n)scheduled_run(n) =  actual_wakeup(n)

Mode B (Wait Multiple, Flush Pending): expected_wakeup(n) =  offset(0),if n=0  scheduled_run(n−1) + period(n), if n>0 scheduled_run(n) = expected_wakeup(n), if expected_wakeup(n) = actual_wakeup(n) expected_wakeup(n) + iterations_behind(n)*period(n), ifexpected_wakeup(n) < actual_wakeup(n)

Mode Safe-B (Wait Multiple, Flush Pending): expected_wakeup(n) = offset(0), if n=0  expected_wakeup(n−1) +iterations_behind(n−1)*period(n), if n>0 scheduled_run(n) = actual_wakeup(n)

Mode C (Wait, Process Pending): expected_wakeup(n) =  offset(0), if n=0  expected_wakeup(n−1) + period(n), if n>0 AND   iterations_behind(n−1)= 0  actual_wakeup(n−1) − (iterations_behind(n−1)−2)*period(n), if n>0AND iterations_behind(n−1) > 0 scheduled_run(n) =  actual_wakeup(n)

Mode D (Flush Pending, Wait): expected_wakeup(n) =  offset(0), if n=0 actual_wakeup(n−1) + period(n), if n>0 scheduled_run(n) = actual_wakeup(n)

Mode E (Ignore Offset, Wait): expected_wakeup(n) =  actual_wakeup(0), ifn=0  actual_wakeup(n−1) + period(n), if n>0 scheduled_run(n) = actual_wakeup(n)

Mode F (Ignore Offset, Delay First Iteration by Period, Wait):expected_wakeup(n) =  actual_wakeup(0), if n=0  actual_wakeup(0) +period(0) + period(1), if n=1  actual_wakeup(n−1) + period(n), if n>0scheduled_run(n) =  actual_wakeup(0) + period(0), if n=0 actual_wakeup(n), if n>0Mode No-Change (Proceed in the Current Mode)

This is the default behavior for the next iteration of the timed loop,unless one of the other modes is explicitly defined (through wiring) onthe right edge of the loop. The computations of the pseudo-variables forthe loop will proceed using the rules given for the current mode. Note,that specifying the No-Change mode on the right edge of the timed loopimplies that a wired value for the offset will be ignored for the nextiteration. A timed loop with the No-change mode as its initial mode hasan undefined behavior.

In another embodiment, additional modes, referred to below as “primedmodes” may be defined, where the additional modes all establish thephase on the first iteration, based on the maximum value of offset andactual_wakeup(0) (the first wake up time for the loop). The primed modesmay behave as follows:

B′: Wait multiple, use specified phase. Run immediately and flushpending when late.

C′: Wait multiple, establish phase on the first iteration, use specifiedoffset if possible and process pending

D′: Wait multiple, flush pending and establish phase on the firstiteration

E′: Wait multiple, establish phase on the first iteration

F′: Wait multiple, establish phase on the first iteration, delayed byone period

Mode A′ (Same as A; Wait Multiple, Process Pending): expected_wakeup(n)=  offset(0), if n=0   expected_wakeup(n−1) + period(n), if n>0scheduled_run(n) =  actual_wakeup(n)

Mode B′ (Wait Multiple, Flush Pending): expected_wakeup(n) = offset(0) + iterations_behind(0) *period(0), if n=0 expected_wakeup(n−1) + period(n), if n>0 scheduled_run(n) = actual_wakeup(n)

Mode C′ (Wait, Process Pending): expected_wakeup(n) =   Max( offset(0),actual_wakeup(0) − (iterations_behind(0) −     1)*period(0) ), if n=0expected_wakeup(n−1) + period(n),     if n>1 scheduled_run(n) =  actual_wakeup(n)

Mode D′ (Flush Pending, Wait): expected_wakeup(n) =   Max( offset(0),actual_wakeup(0) ), if n=0   expected_wakeup(n) + period(n), if n>1scheduled_run(n) =   actual_wakeup(n)

Mode E′ (Ignore Offset): expected_wakeup(n) =   actual_wakeup(0), if n=0  expected_wakeup(n−1) + period(n), if n>0 scheduled_run(n) =  actual_wakeup(n)

Mode F′ (Ignore Offset, Delay First Iteration by Period):expected_wakeup(n) =   actual_wakeup(0), if n=0   expected_wakeup(0) +period(0) + period(1), if n=1   expected_wakeup(0) + period(n), if n>1scheduled_run(n) =   actual_wakeup(n)

FIG. 23 illustrates an expanded chart showing the operation of the timedloop for all of the modes described above.

Exemplary Graphical Program Nodes Associated with Timed Loops

As noted above, in one embodiment the graphical programming developmentenvironment may provide an application programming interface (API) whichcan be used to programmatically configure timed loops in a graphicalprogram. In one embodiment this API may take the form of variousgraphical program nodes that the user can include in the graphicalprogram to configure or control various aspects of the timed loops. Thefollowing describes one embodiment of such a set of graphical programnodes. It is noted that the described nodes are intended as examplesonly.

FIG. 24 illustrates a “Create Timing Source” node. This node may createa timing source reference that can be used as the timing source for oneor more timed loops. In one embodiment each timing source may have itsown unit of timing and/or start time and may not start until the firsttimed loop that uses the timing source starts.

Inputs:

-   -   name (in)—The name (in) input specifies the name of the timing        source to create    -   error in—The error in input describes error conditions that        occur before this node runs. The default is no error. If an        error occurred before this node runs, the node passes the error        in value to error out. This node runs normally only if no error        occurred before this node runs. If an error occurs while this        node runs, it runs normally and sets its own error status in        error out.        Outputs:    -   name (out)—The name of the timing source created by the node.        The name may be passed to other nodes that utilize it.    -   error out—The error out output contains error information. If        error in indicates that an error occurred before this node ran        then error out contains the same error information. Otherwise,        it describes the error status that this node produces.

FIG. 25 illustrates a “Clear Timing Source” node. This node may stop anddelete the specified timing source. If the timing source is associatedwith a DAQmx task, the node may also clear the task. In one embodiment aname cannot be re-used until all timed loops attached to the timingsource terminate.

Inputs:

-   -   name—The name input specifies the name of the timing source to        stop and delete.    -   error in—The error in input describes error conditions that        occur before this node runs. The default is no error. If an        error occurred before this node runs, the node passes the error        in value to error out. This node runs normally only if no error        occurred before this node runs. If an error occurs while this        node runs, it runs normally and sets its own error status in        error out.        Outputs:    -   parent—The parent output specifies the name of the parent of the        timing source deleted by the node. If the timing source has no        parent then the parent output is empty.    -   error out—The error out output contains error information. If        error in indicates that an error occurred before this node ran        then error out contains the same error information. Otherwise,        it describes the error status that this node produces.

FIG. 26 illustrates a “Build Timing Source Hierarchy” node. This nodemay create a hierarchy of timing sources based on the specified timingsource names. The hierarchy may determine the order in which the timingsources start. The parent timing source may not start until after thetiming sources in the hierarchy name input start. This node may be usedwhen there are timing sources that have signal dependencies, such as DAQcounters routed to drive analog input connections. In such a case, thecounter timing source acts as the parent.

Inputs:

-   -   replace (F)—This input replaces any timing source entered in        thetiming source names input if a timing source by that name        already exists in the hierarchy of timing sources.    -   hierarchy name—This input specifies the name of the timing        source hierarchy to create.    -   parent—This input specifies the valid timing source to be        started after the all the timing sources in hierarchy name        start.    -   timing source names—This input specifies an array of names of        the timing sources to add to the timing source hierarchy. If the        replace input is True then the new timing source replaces any        timing source with the same name that already exists in the        timing source hierarchy. These timing sources start before the        timing source specified by the parent input.    -   error in—The error in input describes error conditions that        occur before this node runs. The default is no error. If an        error occurred before this node runs, the node passes the error        in value to error out. This node runs normally only if no error        occurred before this node runs. If an error occurs while this        node runs, it runs normally and sets its own error status in        error out.        Outputs:    -   error out—The error out output contains error information. If        error in indicates that an error occurred before this node ran        then error out contains the same error information. Otherwise,        it describes the error status that this node produces.

FIG. 27 illustrates a “Synchronize Timed Loop Starts” node. This nodemay synchronize the start of the timed loops specified by the loop namesinput by adding their names to the group specified by thesynchronization group name input. Timed loops in a synchronization groupmay wait until all the loops are ready to execute before beginningexecution.

Inputs:

-   -   replace (T)—This input specifies whether to replace the group of        timed loops entered in the synchronization group name input with        the timed loop names entered in the loop names input. If the        replace input is False and the timing source is a member of        another hierarchy then the node may return an error.    -   synchronization group name—This input specifies the name of the        group of timed loops for which to synchronize the start times.    -   timeout ms (10000)—This input specifies the amount of time the        timed loop waits on other members of the synchronization group        to arrive to the synchronization point. If any of the timed        loops in the group do not arrive in time, the timed loop may        return an error. The default is 10,000 ms.    -   loop names—This input specifies the names of the timed loops to        synchronize. By default, if the name of a timed loop is        specified in the loop names input and the group specified by the        synchronization group name input includes that timed loop then        the node deletes the new timed loop from the current group and        adds it to the group specified by the synchronization group name        input. If the replace (T) input is set to False then the node        may return an error to indicate that it could not add the timed        loop to the synchronization group.    -   error in—The error in input describes error conditions that        occur before this node runs. The default is no error. If an        error occurred before this node runs, the node passes the error        in value to error out. This node runs normally only if no error        occurred before this node runs. If an error occurs while this        node runs, it runs normally and sets its own error status in        error out.        Outputs:    -   error out—The error out output contains error information. If        error in indicates that an error occurred before this node ran        then error out contains the same error information. Otherwise,        it describes the error status that this node produces.

FIG. 28 illustrates a “Stop Timed Loop” node. This node may cause thetimed loop specified by the name input to be aborted. If the specifiedtimed loop is running then the timed loop may execute another iterationwith the wakeup reason in the left data node set to “Aborted”.

Inputs:

-   -   priority—This input changes the priority of the timed loop being        aborted. The priority input may be used when the user wants to        stop two or more timed loops and wants to ensure that one stops        before the other.    -   name—This input specifies the name of the timed loop to stop or        abort.    -   error in—The error in input describes error conditions that        occur before this node runs. The default is no error. If an        error occurred before this node runs, the node passes the error        in value to error out. This node runs normally only if no error        occurred before this node runs. If an error occurs while this        node runs, it runs normally and sets its own error status in        error out.        Outputs:    -   error out—The error out output contains error information. If        error in indicates that an error occurred before this node ran        then error out contains the same error information. Otherwise,        it describes the error status that this node produces.        Exemplary Graphical Programs that Use Timed Loops

FIGS. 29-38 illustrate several exemplary graphical programs that utilizeone embodiment of a timed loop structure. It is noted that theseexamples are included to illustrate exemplary uses of one particularembodiment of a timed loop structure in graphical programs written usingthe LabVIEW graphical programming development environment. However, inother embodiments a timed loop structure such as described above maytake on any of various other forms and may be utilized in graphicalprograms written using other graphical programming developmentenvironments.

FIGS. 29 and 30 illustrate the block diagram and GUI of a graphicalprogram that utilizes two timed loops that operate in conjunction witheach other. As described above, in one embodiment the user may be ableto select a desired late mode to specify how a timed loop handlessituations in which late loop iterations occur. This example illustratesthe difference between modes of the timed loop that discard pendingperiods and the modes that process pending periods. As documented on theblock diagram of FIG. 29, one of the timed loops puts an item into ashared queue every 100 ms, while the other timed loop reads an itemevery 100 ms (starting with an offset of 100 ms to wait for the firstitem to be inserted into the queue). The indicator bars on the GUI ofFIG. 30 show the number of items sent, received and in the queue at eachpoint.

The timing of the receiving timed loop can be controlled from the GUI ofFIG. 30 by changing the values of the initial delay, a delay introducedin the tenth iteration. The GUI also allows the user to change the latemode of the receiving timed loop, allowing the different behavior causedby the different late modes to be observed.

The “Receiver is late” indicator on the GUI goes on whenever theprevious iteration of the receiving timed loop was late.

The “Items sent” indicator indicates the number of items sent by thesender timed loop.

The “Items in queue” indicator indicates the number of items in thequeue between the sender timed loop and receiving timed loop.

The “Items received” indicator indicates the number of items received bythe receiving timed loop.

The “Receiver mode” control controls the late mode of the receivingtimed loop.

The “Initial receiver delay” control controls how much time inmilliseconds the receiving timed loop will be delayed. A delay less than100 has no effect, since the receiver has an offset of 100 ms. If thetimed loop is in a mode that processes missed periods, these extraelements will be received in the next iteration of the receiving timedloop. If the mode discards missed periods then the queue will containthis number of items until the sender is done.

The “Receiver delay at iteration 10” control controls how much time towait during iteration number 10 in milliseconds. This delay will causethe sender to add one extra element to the queue every 100 ms. If thetimed loop is in a mode that processes missed periods, these extraelements will be received in the next iteration of the receiving timedloop. If the mode discards missed periods then the queue will containthis number of items until the sender is done.

FIGS. 31A, 31B, and 32 illustrate the block diagram and GUI of agraphical program that utilizes the “Synchronized Timed Loop Starts”node described above to synchronize the start of two timed loops. (Theblock diagram is split into two drawings, FIG. 31A and FIG. 31B, becauseit is too large to fit on one page. FIG. 31A illustrates the top portionof the block diagram, and FIG. 31B illustrates the bottom portion.)

The user can run the graphical program and notice that Loop 2immediately begins plotting whereas Loop 1 must wait 2 seconds before itplots because a “Wait” node delays data from reaching Loop 1 for 2seconds. The user can then click the “Restart with Synchronization”button to restart the timed loops so that their starts are synchronized.Both loops wait the 2 seconds before they start plotting, even thoughthere is no data flow reason keeping Loop 2 from plotting. I.e., thestart of Loop 2 is delayed until Loop 1 starts because the two timedloops are synchronized.

The user can then click the “Restart w/0 Synchroniztion” button torestart the timed loops so that their starts are not synchronized. Nowthe timed loops will behave like they did at the start, i.e., Loop 1will wait, and Loop 2 will immediately begin plotting.

FIGS. 33A, 33B, and 34 illustrate the block diagram and GUI of agraphical program that illustrates an example of multi-rate timed looppreemption. (The block diagram is split into two drawings, FIG. 33A andFIG. 33B, because it is too large to fit on one page. FIG. 33Aillustrates the top portion of the block diagram, and FIG. 33Billustrates the bottom portion.)

There are two timed loops, a low priority timed loop and a high prioritytimed loop. The period of the high priority loop is twice as long asthat of the low priority loop. When the low priority loop is running,the “Low Priority Loop” tank indicator on the GUI of FIG. 34 changes.When the high priority loop executes, indicated by the “High Priorityloop is running” LED, it preempts the low priority loop. Therefore the“Low Priority Loop” tank indicator stops until the high priority loopfinishes. As soon as the high priority loop is finished executing, the“Low Priority Loop” tank indicator starts changing again. The user canchange the controls on the GUI to see different timing and preemptioncharacterisitics.

FIGS. 35 and 36 illustrate the block diagram and GUI of a graphicalprogram that demonstrates how changing the offset of timed loops affectstheir timing. Two loops, A and B, plot a spike at their expected starttimes to illustrate when they started in relationship to each other. Theuser can click the Run button and notice the offset between the spikeson the two plots. The user can operate the controls on the GUI of FIG.36 to change the offset and period of the two loops to see how thechanges affect the timing relationships. A tick is plotted in the graphto show the starting time of each iteration of the two timed loops.

FIGS. 37 and 38 illustrate the block diagram and GUI of a graphicalprogram that is operable to programmatically abort a timed loop. Theuser may run the graphical program and notice that the “Timed LoopIteration” indicator on the GUI of FIG. 38 is increasing. In additionthe “Wakeup reason” indicator says “normal”. The user may then click the“Abort Timed Loop” control. In response, a dialog box appears to informthe user that the timed loop was awakened with a wakeup reason of 1 toindicate that the timed loop was aborted. After the user clicks the OKbutton on this dialog box the timed loop and the graphical programfinish executing with no errors.

Timed Sequences

Many text-based programming languages such as C, BASIC, Java, etc., havean inherent control flow because statements execute in the order inwhich they appear in the program. In contrast, for many types ofgraphical programs, data flow is the main principle governing programexecution. In other words, in a graphical program that is based on adata flow model, a node may execute when all data inputs have arrived atthe node's input terminals. The node may then supply data to its outputterminals when the node has finished executing, and this data may thenpass to input terminals of other nodes in the diagram that are connectedto the node's output terminals. Thus, for this type of graphicalprogram, execution of different portions of the program is data-driven.Thus, in a pure data-flow model, execution order for different portionsof the graphical program is not necessarily guaranteed.

Therefore, for many data-flow based graphical programs, it is necessaryto introduce a layer of control flow over the basic data-flow model. Itis often necessary to explicitly specify an execution order fordifferent portions of a graphical program to force the portions toexecute in a desired sequential order. In some applications it may alsobe necessary to control timing of the respect graphical code portions.

FIG. 39A is a flowchart diagram illustrating one embodiment of a methodfor creating a graphical program that executes a timed sequence ofgraphical code portions. It is noted that FIG. 39A illustrates arepresentative embodiment, and alternative embodiments are contemplated.Also, various elements may be combined, omitted, or performed indifferent orders.

In 801, a plurality of graphical code portions may be included in thegraphical program. Each graphical code portion may represent a sub-taskto be performed in a sequence with other sub-tasks. Each graphical codeportion may include one or more graphical program nodes. The graphicalprogram nodes may be interconnected to visually indicate functionalityof the graphical code portion. In one embodiment the graphical programnodes may be interconnected to indicate data flow.

In 803, a sequential order of execution may be configured for thegraphical code portions. For example, the user may provide input to thegraphical programming development environment to specify the sequentialorder of execution for the graphical code portions.

In 805, first execution timing information may be configured for one ormore of the graphical code portions. For example, the user may provideinput to the graphical programming development environment to specifythe first execution timing information. In various embodiments, thefirst execution timing information may comprise any kind of informationthat affects the timing of execution of one or more of the graphicalcode portions during execution of the graphical program. As one example,the first execution timing information may specify a time when agraphical code portion should begin executing. Exemplary types ofexecution timing information are described below.

In 807, the graphical program may be executed.

Executing the graphical program may comprise executing the plurality ofgraphical code portions. As indicated in 809, the graphical codeportions may be executed sequentially in the sequential order and inaccordance with the first execution timing information. For example, ifthe first execution timing information specifies that a particulargraphical code portion should begin executing at a time T, thenexecution of the sequence of graphical code portions may be controlledso that the graphical code portion begins execution at the time T.

In one embodiment the user may configure the timed sequence of graphicalcode portions with a timing source, on which the execution timing isbased. In various embodiments, any of various kinds of timing sourcesmay be used, similarly as described above with respect to the timed loopstructure.

As noted above, the user may configure any of various kinds of executiontiming information for the graphical code portions. For example, in oneembodiment the user may configure a deadline for a particular graphicalcode portion, where the deadline specifies a time by which execution ofthe graphical code portion must complete. In one embodiment thespecified time by which execution of the graphical code portion mustcomplete may be relative to a time when the graphical code portionbegins execution.

As another example, in one embodiment the user may configure an offsetfor a particular graphical code portion, where the offset for thegraphical code portion specifies a length of time to wait before thegraphical code portion begins executing. (In one embodiment the offsetmay only apply to the first graphical code portion of the sequence.)

As another example, in one embodiment the user may configure a starttime for a particular graphical code portion, where the start timespecifies a time when the graphical code portion should begin executing.In one embodiment the start time may be an absolute time value (withrespect to the timing source). In another embodiment the start time maybe relative to another time value.

As another example, in one embodiment the user may configure a priorityfor a particular graphical code portion. During execution of thegraphical program, the graphical code portion may be executed accordingto the configured priority. The user may configure different prioritiesfor different graphical code portions.

As another example, in one embodiment the user may configure a timeoutfor a particular graphical code portion. The timeout for the graphicalcode portion may specify a maximum length of time the graphical codeportion can wait before beginning to execute.

In one embodiment, the user may configure execution timing informationfor a particular graphical code portion, where the execution timinginformation is based on one or more execution time values for thegraphical code portion that executed previously. For example, theprevious graphical code portion may execute to produce one or moreexecution time values, and these execution time values may be used tocontrol execution timing for the next graphical code portion. As oneexample, the next graphical code portion may be timed to begin executingat say, 50 ms, after the previous graphical code portion completesexecution. Thus, in this example, the previous graphical code portionexecutes to produce an “execution completion time” execution time value,which is then used to control the execution start time for the nextgraphical code portion.

One technique for specifying the sequential order and the firstexecution timing information for the different graphical programportions is through the use of a timed sequence structure node, alsoreferred to as simply a timed sequence structure. The user may include atimed sequence structure node in the graphical program and may associatethe plurality of graphical code portions with the timed sequencestructure node such that the timed sequence structure node species asequential order of execution for the graphical code portions. The usermay also configure the timed sequence structure node with executiontiming information for one or more of the graphical code portions.During execution of the graphical program, the timed sequence structurenode may be operable to control execution of the graphical code portionsto cause the graphical code portions to execute in the desiredsequential order and in accordance with the execution timinginformation.

In one embodiment the timed sequence structure node may include aplurality of ordered frames. The user may be able to specify the desirednumber of frames, N, for the timed sequence structure and may associatea graphical code portion with each frame. For example, in one embodimenteach frame may include an interior portion, and the user may associate agraphical code portion with a frame by positioning or displaying thegraphical code portion within the interior portion. The plurality ofordered frames may define an execution order for the correspondingportions of graphical source code, such that during execution of thegraphical program, the portions of graphical source code are executedsequentially according to this execution order. For example, duringexecution of the graphical program, the portion of graphical source codein frame 0 may execute first, followed by the portion of graphicalsource code in frame 1, followed by the portion of graphical source codein frame 2, etc., up to the portion of graphical source code in frame N.

In various embodiments, a timed sequence structure may have any ofvarious appearances in the graphical program. In one embodiment, only asingle frame may be visible at a time. The user may be able to scrollthrough the frames to view the desired one. In another embodiment, all(or at least a subset) of the frames of the sequence structure may bevisible simultaneously. The frames may be positioned or laid out withinthe graphical program in any of various ways. In one embodiment, theframes may be displayed side by side in a left-to-right order, e.g.,such that the right-side border of one frame is also the left-sideborder of an adjacent frame. In other embodiments, frames may bepositioned in an up-to-down order, or in a combination of left-to-rightand up-to-down orders.

Any of various techniques may be used in determining the execution orderof the frames. In one embodiment, the execution order for a particularframe may be inherently specified by the frame's location among theother frames. For example, if the frames are displayed in aleft-to-right order, then execution of the frames (i.e., execution ofthe graphical source code portions within the frames) may also proceedin this same left-to-right order. In another embodiment, the user mayprovide user input to specify a desired execution order for the frames.

The timed sequence structure may also allow the user to specify a timingsource and specify various other execution timing information for theframes of the timed sequence structure. For example, the user mayconfigure one or more of the frames with deadlines, timeouts, starttimes, priorities, etc., similarly as described above.

As described above, in various embodiments, the user may be able tospecify various types of information affecting execution timing of theframes in a timed sequence structure. Many applications need to performa series of timed sub-tasks, and users are often interested in ensuringthat the sub-tasks have a specified time bound and a certain time delay.A time bound on a sub-task specifies a time by which the sub-task mustfinish its execution. A time delay specifies a time after which asub-task can start executing. Thus, in one embodiment the graphicalprogramming development environment may allow the user to specify timebounds and time delays for the frames in a timed sequence structure.

FIG. 39 illustrates one embodiment of a timed sequence structure node.In this simple example the timed sequence structure includes only asingle frame. (No graphical source code is shown within the frame inthis example, in order to simplify the drawing.) As shown, the timedsequence structure of FIG. 39 includes a configuration node on the topleft. The configuration node is responsible for gathering timinginformation for the first frame of the timed sequence structure. Rightclicking on the configuration node or elsewhere on the timed sequencestructure may invoke a menu with a “Configure” option on it, which inturn invokes a configuration dialog. The configuration dialog may alsobe invoked by a double-click on the configuration node. Timinginformation for the timed sequence structure can either be set throughthe configuration dialog or wired in through terminals in theconfiguration node, similarly as described above with respect to timedloops.

The timed sequence structure also includes an output node whichpropagates errors and the timing information from the last frame in thetimed sequence structure.

In one embodiment each frame of the timed sequence structure may have aset of data nodes, referred to as the left data node and right datanode. The left data node returns timing information on the previous andcurrent frame of the timed sequence structure. For example, in FIG. 39the single frame of the timed sequence structure has a left data nodethat includes various data fields such as “Deadline”, “Start”,“Priority”, etc. For example, the “Deadline” data field specifies thepoint in time (relative to expected start of current frame) that thecurrent sequence frame should finish executing. Other data fields of theleft data node are described below. The frame in the timed sequencestructure illustrated in FIG. 39 also has a right data node thatincludes various data fields indicated by different icons. Data fieldsof the right data node for a given frame in the timed sequence structuremay specify timing information for the next frame in the timed sequencestructure. (In this example, the right data node fields may not be usedsince there is only one frame in the timed sequence structure.) Datafields of the right data node are described below. For each frame in thetimed sequence structure, the user may invoke a dialog associated withthe frame's right data node to statically configure the timinginformation for the next frame of the timed sequence structure. FIG. 40illustrates an exemplary dialog for specifying timing information forthe next frame, such as a Start time, a Priority, a Timeout, and aDeadline.

As described above, the user may invoke a configuration dialogassociated with the configuration node of the timed sequence structure,which allows the user to statically configure various aspects of thetiming of the timed sequence structure. FIG. 41 illustrates oneexemplary configuration dialog. As shown, this configuration dialogallows the user to specify a timing source for the timed sequencestructure. The timing source may comprise an entity useable for timingand scheduling of frames in the timed sequence structure. In variousembodiments the graphical programming development environment may allowthe user to specify any kind of timing source, similarly as describedabove with reference to timed loops. In the example of FIG. 41, the“Source” list box displays four selectable timing sources. The “1 kHzclock” item refers to a 1 ms system clock of the computer system. The “1MHz clock” item refers to a 1 us Pentium counter available on certainPentium computer systems. The “1 kHz clock <resettable>” item refers toa 1 kHz timing source that resets on the first call of every invocationof the sequence. The “1 MHz Clock <resettable>” item refers to a 1 Mhztiming source that resets on the first call of every invocation of thesequence.

Thus, in this embodiment, there are two units of built-in timing sourcesavailable—milliseconds and microseconds. Each of these has a resettableversion of the timing source. A resettable timing source does not have acreation overhead at the time of initialization, and it resets to zeroon the first call of every invocation of the sequence. For example, if atimed sequence structure configured with a resettable timing source isplaced within a loop, then at the beginning of every iteration of theloop, the timing source resets to zero. A resettable timing source maybe more efficient than a non-resettable timing source.

In other embodiments the graphical programming development environmentmay allow the user to configure the timed sequence structure with any ofvarious other kinds of timing sources, similarly as described above withrespect to timed loops.

The configuration dialog of FIG. 41 also allows the user to specify a“Source name” for the timing source. The source name specifies a namefor the timed sequence structure's instance of the timing source.Multiple timed sequence structures may be configured with the sametiming source and the same source name for the timing source. This meansthat all the timed sequence structures will share the same instance ofthe timing source. Thus, timing information for each timed sequencestructure, such as the offset, will be relative to the same startingpoint. However, timed sequence structures configured with differentnames for the same timing source will be governed by different instancesof the timing source. In this case, timing of the timed sequencestructures is independent from each other.

The configuration dialog of FIG. 41 also allows the user to specify a“Timeout” for the timed sequence structure. A frame of the timedsequence structure may time out if it is not awakened by the timeouttime specified.

The configuration dialog of FIG. 41 also allows the user to specify an“Offset” for the timed sequence structure. The offset specifies thestart time in absolute time for the first frame of the timed sequencestructure. The offset is specified with reference to the start of thetiming source. The default value for the offset is zero which means nooffset, i.e., start immediately.

The configuration dialog of FIG. 41 also allows the user to specify a“Deadline” for the timed sequence structure. The deadline specifies apoint in time when each frame must finish its execution. This specifiesa time bound for each frame.

The configuration dialog of FIG. 41 also allows the user to specify a“Priority” for the timed sequence structure. Higher values may signifyhigher priorities.

The configuration dialog of FIG. 41 also allows the user to specify a“Sequence name” for the timed sequence structure. The sequence name maybe useful to allow the user to make various API calls, e.g., to grouptogether several timed sequence structure and or timed loops tosynchronize their starts. This name may also appear in a user interfacethat displays timing information for the timed sequence structure whenthe graphical program is executed, to allow the user to identify thetimed sequence structure.

As discussed above, each frame of a timed sequence structure may have aset of data nodes, referred to as the left data node and right datanode. The left data node returns timing information on the previous andcurrent frame of the timed sequence structure, and the right data nodespecifies timing information for the next frame in the timed sequencestructure. FIG. 42 is an exemplary timed sequence structure with threeframes, in which the left and right data nodes are illustrated in moredetail.

The left data node for a given frame may include a first set of datafields that return timing information for the previous frame of thetimed sequence structure and a second set of data fields that returntiming information for the current frame of the timed sequencestructure. For example, the middle frame in the timed sequence structureof FIG. 42 is labeled with arrows showing that the top three fields(“Expected End”, “Actual End”, and “Finished Late?”) in the left datanode for the middle frame return timing information for the previousframe. The next seven fields in the left data node for the middle framereturn timing information for the current frame, i.e., the middle frameitself. As shown in FIG. 42, the left data node for the first(left-most) frame does not have data fields for the previous frame sincethere is no previous frame.

In one embodiment the left data node for a given frame may include thefollowing data fields:

Expected End—the expected end time (in absolute time units from start ofsequence) of the previous frame. (formula: ExpectedEnd=ExpectedStart+Deadline−1)

Actual End—the actual end time (in absolute time units from start ofsequence) of the previous frame.

Finished Late?—True if the deadline of the previous frame was missed.(formula: FinishedLate=ActualEnd>ExpectedEnd)

Expected Start—the expected start time (in absolute time units fromstart of sequence) of the current frame.

Actual Start—the actual start time (in absolute time units from start ofsequence) of the current frame.

Wakeup reason—the reason the scheduler woke up the frame. The possiblevalues are 0 for normal wakeup, 1 for Sequence Aborted (possible reasonsinclude the timing source got deleted), and 2 for Async wakeup messagereceived.

Timeout—the maximum time (in millisecs) the sequence frame should waitto be woken up. Default value is −1 which means infinity. Valid valuesare {−1,0 . . . }

Deadline—the maximum point in time (relavtive to expected start ofcurrent frame) by which the current sequence frame should finishexecuting. Valid values are {−1,0,1, . . . } where −1 means unspecified.

Start—Time the current frame was supposed to start. This is relative tothe start of the previous frame. For example: if the value coming out is100, then it means that the current frame has a start value of 100 unitsof time after the expected start of the previous frame. Valid values are{−1,0,1, . . . } where −1 means unspecified.

Priority—the priority of the current frame. Valid values are {−1,0,1, .. . } where −1 means unspecified.

Error—scheduler error out.

Global end time—timing source independent time stamp (in nanoseconds) ofend of execution of the previous frame.

Global start time—timing source independent time stamp (in nanoseconds)of start of execution of the current frame.

As shown in FIG. 42, the right data nodes for the first and secondframes include data fields for specifying timing information for thenext frame in the timed sequence structure. However, the right data nodefor third (right-most) frame includes only a field for propagating errorinformation, since it is the last frame, i.e., there is no next frame.

In one embodiment the right data node for a given frame may include thefollowing data fields:

Timeout—the timeout value specifies the maximum time the next sequenceframe should wait to be woken up. Default value is −1 which meansinfiniately. Valid values are {−1,0,1, . . . }

Deadline—maximum point in time (relative to expected start of nextframe) by which the next sequence frame should finish executing. Validvalues are {−1,0,1, . . . } where −1 means unspecified.

Start—time the next frame is supposed to start. Relative to expectedstart of the current frame. Valid values are {−1,0,1, . . . } where −1means unspecified.

Priority—priority of the next frame.

Error—error in, will skip the execution of the next frame(s)

FIGS. 43-46 illustrate some simple examples of a timed sequencestructure such as described above. The timing behavior of each timedsequence structure differs based on the timed sequence structure'sconfiguration. The timing behavior for each case is summarized asfollows:

-   -   FIG. 43—Frame Starts={0,100,200} ticks of the clock. Frame        Deadlines=<unspecified>. Frame Execution Times={50, 110, 60}    -   FIG. 44—Frame Starts={0,100,200} ticks of the clock. Frame        Deadlines={50,50,50}. Frame Execution Times={40, 60, 40}    -   FIG. 45—Frame Starts=<unspecified>. Frame Deadlines={50,50,50}.        Frame Execution Times={40, 75, 40}    -   FIG. 46—Frame Starts=<unspecified>. Frame        Deadlines=<unspecified>. Frame Execution Times={40, 75, 40}        Timed Loop with Sequence Frames

For many applications it is necessary to perform a timed sequence ofsub-tasks such as described above repetitively, where the timing of eachrepetition of the timed sequence is precisely controlled. FIG. 47A is aflowchart diagram illustrating one embodiment of a method for creating agraphical program that performs a timed sequence of graphical codeportions for a plurality of iterations, where the timing of eachiteration of the sequence is controlled. It is noted that FIG. 47Aillustrates a representative embodiment, and alternative embodiments arecontemplated. Also, various elements may be combined, omitted, orperformed in different orders.

In 851, a loop may be included in the graphical program.

In 853, the loop may be configured with first execution timinginformation.

In 855, a plurality of graphical code portions may be included in thegraphical program such that the graphical code portions are associatedwith the loop.

In 857, a sequential order of execution may be configured for thegraphical code portions.

In 859, second execution timing information may be configured for thegraphical code portions.

In 861, the graphical program may be executed.

In 863, the loop executes the graphical code portions for a plurality ofiterations, where each iteration is executed in accordance with thefirst execution timing information.

As indicated in 865, in each iteration of the loop, the graphical codeportions are executed in the sequential order and in accordance with thesecond execution timing information.

In various embodiments the steps above may be performed in any ofvarious ways. In one embodiment, including the loop in the graphicalprogram may comprise including a timed loop node such as described abovein the graphical program. The timed loop node may be configured with thefirst execution timing information. In one embodiment the user mayinclude a timed sequence structure node within the timed loop node andconfigure the timed sequence structure node with the second executiontiming information. Thus, in each iteration of the timed loop, thegraphical code portions associated with the frames of the timed sequencestructure node may be executed according to the second execution timinginformation. For example, the user may configure the timing of the timedloop node and the timed sequence structure node so that the timed loopexecutes according to the desired execution period and other timingcriteria and so that the frames of the timed sequence structure executewith the desired timing at each repetition of the timed loop.

In another embodiment the graphical programming development environmentmay provide an integrated structure (a combination structure node) thatcombines functionality of the timed loop and the timed sequencestructure. Such a combination structure node is also referred to hereinas a “timed loop with frames” structure node.

A “timed loop with frames” structure node that combines thefunctionality of both a timed loop and a timed sequence may simplify thegraphical program somewhat and make it easier for the user to configurethe desired timing. For example, the user may interact with a commondialog to specify timing information for both the timed loop and thetimed sequence.

Having a single structure node that provides the combined functionalityof the timed loop and the timed sequence structure may also allow thegraphical program to execute more efficiently, since a single executionsystem can manage the execution of the frames of the timed sequencestructure within the timed loop.

In one embodiment the graphical programming development environment mayprovide a “timed loop with frames” combination structure node which theuser can include in his graphical program, e.g., by dragging anddropping it from a palette into the graphical program. In anotherembodiment the user may first include a timed loop node in the graphicalprogram and may then request the graphical programming developmentenvironment to change the timed loop node into a “timed loop withframes” structure node, or the user may first include a timed sequencenode in the graphical program and may then request the graphicalprogramming development environment to change the timed sequence nodeinto a “timed loop with frames” structure node. For example, the usermay first include a timed loop in the graphical program. A regular timedloop name is semantically equivalent to a timed loop having a singleframe. If the user desires a timed sequence of sub-tasks to execute ateach iteration of the timed loop then the user may create additionalframes within the timed loop. For example, the user may invoke a popupmenu with menu items such as “Add Frame Before” and “Add Frame After” tocreate an additional frame. For example, selecting the “Add Frame After”menu item on an empty Timed Loop would result in a two frame loop suchas shown in FIG. 47. The menu may also include a “Delete This Frame”menu item that allows the removal of a frame from the loop. Within eachframe of the timed loop, the user may include a portion of graphicalsource code, similarly as described above. Thus, at each repetition ofthe timed loop, the portions of graphical source code in the frames mayexecute sequentially according to the ordering of the frames, similarlyas described above.

The graphical programming development environment may also allow theuser to configure timing of both the timed loop itself and the frameswithin the timed loop, e.g., by statically setting timing informationsuch as described above and/or configuring timing information to be setdynamically during execution of the graphical program. For example,configuration options and feedback available for a timed loop withmultiple frames may comprise a union of the options and feedbackavailable for an individual timed loop or timed sequence structure. Thisincludes static configuration through the “timed loop with frame”structure's configuration dialog and runtime configuration and feedbackusing the right and left data nodes respectively.

Static configuration dialogs may be provided for configuring the timingof the loop as a whole as well as for individual frames. FIG. 48illustrates an exemplary dialog for configuring the timed loop as awhole. As shown, the dialog provides controls for specifying timinginformation for the timed loop, such as a timing source, period,priority, etc., similarly as described above for timed loops. FIG. 49illustrates an exemplary dialog for configuring the right data nodewithin each frame of the timed loop. As shown, the dialog providescontrols for specifying timing information for the next frame, similarlyas described above for timed sequence structures. Note that the rightdata node of the last frame provides configuration for the execution ofthe first frame during the next iteration. The left data node of thefirst frame provides feedback from the execution of the last frameduring the previous iteration. Also note that the set of elementsavailable through a given data node may change as frames are added ordeleted at the ends of the sequence. Controls for specifying the period,offset, and late mode may only appear or may only be enabled on thedialog for the last frame in the timed loop, since these propertiesaffect timing for the next iteration of the timed loop. On the otherhand, the control for specifying the “Start” may appear or may beenabled on the dialog for all frames except the last frame.

At each iteration of the loop, execution of individual frames within thetimed loop may have the same semantics as the execution of frames withina timed sequence structure such as described above. Execution of theframes may proceed from left to right with the contents of frame ‘i’completing before anything in frame ‘i+1’ executes. The time at which aframe begins execution is controlled primarily by its ‘Start’ value,though execution may begin late if code which must execute before theframe does not complete in time.

The timing source for the individual frames may be the same as that ofthe overall timed loop, or it may be a different timing source. If it isthe same as the overall loop, the user should ensure that the sum ofeach frame's period does not exceed the overall timed loop's period. Inone embodiment the graphical programming development environment mayindicate an error condition to the user if this is not the case.

In the embodiments described above, timed loops or other elements may beincluded in a graphical program and configured with timing informationmanually, i.e., in response to direct user input. In another embodiment,the graphical program may be programmatically generated, e.g., asdescribed in the above-incorporated patent application titled, “Systemand Method for Programmatically Generating a Graphical Program inResponse to Program Information”. For example, the user may utilize atool or wizard operable to programmatically generate the graphicalprogram. Thus, timed loops and other graphical program elementsdescribed herein may be programmatically included in the graphicalprogram and programmatically configured with timing information.Graphical source code may also be programmatically associated with thetimed loops. It is noted that in one embodiment multiple timed loops maybe programmatically included in the graphical program.

It is noted that various embodiments may further include receiving,sending or storing instructions and/or data implemented in accordancewith the foregoing description upon a carrier medium.

Although the embodiments above have been described in considerabledetail, numerous variations and modifications will become apparent tothose skilled in the art once the above disclosure is fully appreciated.It is intended that the following claims be interpreted to embrace allsuch variations and modifications.

1. A carrier medium comprising program instructions for creating agraphical program, wherein the program instructions are executable to:include a plurality of graphical code portions in the graphical program,wherein the graphical program comprises a plurality of interconnectednodes that visually indicate functionality of the graphical program;configure a sequential order of execution for the graphical codeportions; and configure execution timing information for one or more ofthe graphical code portions; wherein during execution of the graphicalprogram, the graphical code portions are executed sequentially in thesequential order and in accordance with the execution timinginformation.
 2. The carrier medium of claim 1, wherein the programinstructions are further executable to: display a first node in thegraphical program; wherein said configuring the sequential order ofexecution for the graphical code portions comprises associating theplurality of graphical code portions with the first node; wherein duringexecution of the graphical program, the first node is operable tocontrol execution of the graphical code portions to cause the graphicalcode portions to execute in the sequential order and in accordance withthe execution timing information.
 3. The carrier medium of claim 2,wherein the first node has a plurality of frames for receivingrespective graphical code portions; wherein said associating theplurality of graphical code portions with the first node comprisesassociating each of the graphical code portions with one of the framesof the first node, wherein the frames define the sequential order ofexecution for the respective graphical code portions.
 4. The carriermedium of claim 3, wherein each of the frames of the first node has aninterior portion; wherein said associating each graphical code portionwith one of the frames of the first node comprises positioning thegraphical code portion within the interior portion of the frame.
 5. Thecarrier medium of claim 4, wherein the plurality of frames are displayedin the graphical program such that each frame is visible at the sametime; wherein the frames visually indicate that the graphical codeportions within the frames are executed in the sequential order definedby the frames.
 6. The carrier medium of claim 4, wherein the frames aredisplayed side by side with respect to each other in a left-to-rightorder; wherein the frames visually indicate that the graphical codeportions within the frames are executed sequentially in theleft-to-right order.
 7. The carrier medium of claim 2, wherein thegraphical program includes one or more nodes that are not associatedwith the first node; wherein execution of the one or more nodes notassociated with the first node is not controlled by the first nodeduring execution of the graphical program.
 8. The carrier medium ofclaim 2, wherein the first node has a visual appearance that visuallyindicates that the first node is operable to cause the graphical codeportions to execute in the sequential order.
 9. The carrier medium ofclaim 2, wherein the first node has a visual appearance that visuallyindicates that the first node is operable to cause the graphical codeportions to execute in accordance with the execution timing information.10. The carrier medium of claim 1, wherein the program instructions arefurther executable to: execute the graphical program, wherein saidexecuting the graphical program comprises executing the graphical codeportions in the sequential order and in accordance with the executiontiming information.
 11. The carrier medium of claim 1, wherein each ofthe plurality of graphical code portions comprises a plurality ofinterconnected nodes that visually indicate functionality of thegraphical code portion.
 12. The carrier medium of claim 1, wherein saidconfiguring execution timing information for one or more of thegraphical code portions comprises configuring execution timinginformation for a first graphical code portion; wherein said configuringexecution timing information for the first graphical code portioncomprises configuring a first deadline for the first graphical codeportion; wherein the first deadline for the first graphical code portionspecifies a time by which execution of the first graphical code portionmust complete.
 13. The carrier medium of claim 12, wherein the specifiedtime by which execution of the first graphical code portion mustcomplete is relative to a time when the first graphical code portionbegins execution.
 14. The carrier medium of claim 1, wherein saidconfiguring execution timing information for one or more of thegraphical code portions comprises configuring execution timinginformation for a first graphical code portion; wherein said configuringexecution timing information for the first graphical code portioncomprises configuring an offset for the first graphical code portion;wherein the offset for the first graphical code portion specifies alength of time to wait before the first graphical code portion beginsexecuting.
 15. The carrier medium of claim 1, wherein said configuringexecution timing information for one or more of the graphical codeportions comprises configuring a timing source to control executiontiming for the one or more graphical code portions.
 16. The carriermedium of claim 1, wherein said configuring execution timing informationfor one or more of the graphical code portions comprises configuringexecution timing information for a first graphical code portion; whereinsaid configuring execution timing information for the first graphicalcode portion comprises configuring a first priority for the firstgraphical code portion; wherein during execution of the graphicalprogram, the first graphical code portion is executed according to thefirst priority.
 17. The carrier medium of claim 16, wherein saidconfiguring execution timing information for one or more of thegraphical code portions further comprises configuring execution timinginformation for a second graphical code portion; wherein saidconfiguring execution timing information for the second graphical codeportion comprises configuring a second priority for the second graphicalcode portion; wherein during execution of the graphical program, thefirst graphical code portion is executed according to the first priorityand the second graphical code portion is executed according to thesecond priority.
 18. The carrier medium of claim 1, wherein saidconfiguring execution timing information for one or more of thegraphical code portions comprises configuring execution timinginformation for a first graphical code portion; wherein said configuringexecution timing information for the first graphical code portioncomprises configuring a timeout for the first graphical code portion;wherein the timeout for the first graphical code portion specifies amaximum length of time the first graphical code portion can wait beforebeginning to execute.
 19. The carrier medium of claim 1, wherein saidconfiguring execution timing information for one or more of thegraphical code portions comprises configuring execution timinginformation for a first graphical code portion; wherein said configuringexecution timing information for the first graphical code portioncomprises configuring a start time for the first graphical code portion;wherein the start time for the first graphical code portion specifies atime when the first graphical code portion should begin executing. 20.The carrier medium of claim 1, wherein said configuring the sequentialorder of execution includes configuring a first graphical code portionto execute before a second graphical code portion; wherein saidconfiguring the execution timing information comprises configuringexecution timing information for the second graphical code portion basedon one or more execution time values for the first graphical codeportion.
 21. The carrier medium of claim 20, wherein during execution ofthe graphical program, the first graphical code portion is executedbefore the second graphical code portion, wherein execution of the firstgraphical code portion produces the one or more execution time valuesfor the first graphical code portion; wherein execution of the secondgraphical code portion is timed based on the one or more execution timevalues for the first graphical code portion.
 22. A carrier mediumcomprising program instructions for creating a graphical program,wherein the program instructions are executable to: display a first nodein the graphical program, wherein the first node has a plurality offrames for receiving respective graphical code portions; associate arespective graphical code portion with each frame of the first node,wherein the frames define a sequential order of execution for thegraphical code portions; and configure execution timing information forone or more of the frames; wherein during execution of the graphicalprogram, the first node is operable to control execution of thegraphical code portions associated with the frames to cause thegraphical code portions to execute in the sequential order defined bythe frames and in accordance with the execution timing information. 23.The carrier medium of claim 22, wherein each of the frames of the firstnode has an interior portion; wherein said associating each graphicalcode portion with one of the frames of the first node comprisespositioning the graphical code portion within the interior portion ofthe frame.
 24. The carrier medium of claim 23, wherein the plurality offrames are displayed in the graphical program such that each frame isvisible at the same time; wherein the frames visually indicate that thegraphical code portions within the frames are executed in the sequentialorder defined by the frames.
 25. The carrier medium of claim 22, whereinthe first node has a visual appearance that visually indicates that thefirst node is operable to cause the graphical code portions to executein accordance with the execution timing information.
 26. The carriermedium of claim 22, wherein the first node is operable to display atleast a portion of the execution timing information in the graphicalprogram.
 27. A node for use in a graphical program, the node comprising:an icon that is displayed on a display of a computer system, wherein theicon visually indicates a plurality of frames for receiving respectivegraphical code portions, wherein the frames define a sequential order ofexecution for the graphical code portions, wherein the icon alsovisually indicates that execution of the graphical code portions isperformed in accordance with execution timing information; and programinstructions operable to cause the graphical code portions to execute inthe sequential order defined by the frames and in accordance with theexecution timing information.